Algorithms JS

insertion-sort.js

  const insertionSort = function(A) {
    for (let j = 1; j <= A.length; j++) {
      let key = A[j];

      let i = j-1;
      while (i >= 0 && A[i] > key) {
        A[i+1] = A[i];
        i = i-1;
        A[i+1] = key;
      }
    }
  }