Insertion sort

insertion_sort.js

const insertionSort = (input) => {
  let data = input.slice()
  for(var i = 1; i < data.length; i++) {
    for(var j = i; j > 0; j--) {
      if(data[j] < data[j - 1]) { exchange(data, j - 1, j) } else { break }
    }
  }

  return data;
}

const exchange = (list, left, right) => {
  const mid = list[left]
  list[left] = list[right]
  list[right] = mid
}