insertion-sort.js

function insertionSort(array) {
  const length = array.length
  for (i = 0; i < length; i++) {
    if (array[i] > array[i + 1]) {
      let temp = array[i]
      array[i] = array[i + 1]
      array[i + 1] = temp
      for (j = i - 1; j >= 0; j--) {
        if (array[j] > array[j + 1]) {
          let temp = array[j]
          array[j] = array[j + 1]
          array[j + 1] = temp
        }
      }
    }
  }
  return array
}

insertionSort([99, 44, 6, 2, 1, 5, 63, 87, 283, 4, 0]);