insertion-sort.js

function insertionSort(array) {
  let i = 1;
  let x;
  while (i < array.length) {
    x = array[i]
    let j = i - 1;
    while (j >= 0 && array[j] > x) {
      array[j + 1] = array[j];
      j = j - 1;
    }
    array[j + 1] = x;
    i = i + 1;
  }
}