insertionSort

insertionSort.js

export default function sort(originalArray) {
  const arr = [...originalArray]

  for(let i = 1; i < arr.length; i += 1) {
    let currentIndex = i

    while(
      arr[currentIndex - 1] !== undefined
      && arr[currentIndex - 1] > arr[currentIndex]
    ) {
      [
        arr[currentIndex], 
        arr[currentIndex - 1]
      ] = [
        arr[currentIndex - 1], 
        arr[currentIndex]
      ]

      currentIndex -= 1
    }
  }

  return arr
}