Implement an Insertion Sort Algorithm

insertionSort.js

/* Using C-Style for-loop */
const insertionSort = array => {
  const arr = array.slice();
  for (let i = 1; i < arr.length; i++) {
    const sortedArr = arr.slice(0, i);
    for (let j = 0; j < sortedArr.length; j++) {
      if (sortedArr[j] > arr[i]) {
        const pickedEl = arr.splice(i, 1)[0];
        arr.splice(j, 0, pickedEl);
        break;
      }
    }
  }
  return arr;
};

insertionSort2.js

/* Using while loop */
const insertionSort2 = array => {
  const arr = array.slice();
  let i = 1;
  while (i < arr.length) {
    const sortedArr = arr.slice(0, i);
    let j = 0;
    while (j < sortedArr.length) {
      if (sortedArr[j] > arr[i]) {
        const pickedEl = arr.splice(i, 1)[0];
        arr.splice(j, 0, pickedEl);
        break;
      }
      j++;
    }
    i++;
  }
  return arr;
};

insertionSort3.js

/* Using Recursive Function */
const insertionSort3 = array => {
  const recursiveSort = (arr, i) => {
    if (i === arr.length) return arr;
    const sortedArr = arr.slice(0, i);
    for (let j = 0; j < sortedArr.length; j++) {
      if (sortedArr[j] > arr[i]) {
        const pickedEl = arr.splice(i, 1)[0];
        arr.splice(j, 0, pickedEl);
        break;
      }
    }
    return recursiveSort(arr, i + 1);
  };
  return recursiveSort([...array], 0);
};