Insertion sort

insertionSort.js

"use strict";

function insertionSort() {
  var list = arguments.length <= 0 || arguments[0] === undefined ? [] : arguments[0];

  for (var i = 0; i < list.length; i++) {
    var key = list[i];
    var prevIndex = i - 1;
    while (prevIndex >= 0 && list[prevIndex] > key) {
      list[prevIndex + 1] = list[prevIndex];
      console.log(list);
      prevIndex--;
    }
    list[prevIndex + 1] = key;
    console.log("\n");
  }

  return list;
}

console.log(insertionSort([9, 8, 100, 5, 1, 9, 11]));