Vintage Insertion Sort

vintage-insertion-sort.js

const vintageInsertionSort = (data) => {
  console.log('data input : ', data);

  for (let i = 1; i < data.length; i++) {
    console.log('data i : ', data);
    
    // First, choose the element at index 1
    let current = data[i];
    let j;

    // Loop from right to left, starting from i-1 to index 0
    for (j = i - 1; j >= 0 && data[j] > current; j--) {
      // as long as data[j] is bigger than current
      // move data[j] to the right at arr[j + 1]
      data[j + 1] = data[j];
    }
    
    // Place the current element at index 0
    // or next to the smaller element
    data[j + 1] = current;
  }
  return data;
}

console.log(vintageInsertionSort([89, 13, 57, 44, 71, 51]))