Insertion Sort Alagorithm

insertionSort.js

function insertionSort(arr) {
  for (let i = 1; i < arr.length; i++) {
    for (let j = i; j > 0; j--) {
      if (arr[i] < arr[j - 1]) {
        const temp = arr[i]
        arr[i] = arr[j - 1]
        arr[j - 1] = temp
        i--
      }
    }
  }
  return arr
}