Insertion Sort Algorithm

insertion_sort.js

function insertSort(array) {
  const n = array.length;
  
  // loop from second element of array to last element
  // because first element is first element of sorted portion
  // at the beginning
  for (let i = 1; i < n; i++) {
    const element = array[i];
    let j = i;
  
    // shift the target element to the left
    // until the target element is greater than left one
    while (j > 0 && array[j - 1] > element) {
      array[j] = array[j - 1];
      j--;
    }
    array[j] = element;
  }
  
  return array;
}

console.log(insertSort([76, 23, 4, 7, 11]));