JavaScript Insertion Sort

insertionSort.js

let array = [3,1,4,5,3,2,6];

for(let i = 1; i < array.length; i++) {
  let j = i - 1; // array[0...i-1] is sorted
  let temp = array[i];
  
  while(j >= 0 && array[j] > temp) {
    array[j+1] = array[j];
    j--;
  }
  array[j+1] = temp;
}

console.log(array); // [1, 2, 3, 3, 4, 5, 6]