function insertionSort(arr) {
  for (let j = 1; j < arr.length; j++) {
    let key = arr[j]
    let i = j - 1
    while (i >= 0 && key < arr[i]) {
      i--
    }
    arr.splice(i + 1, 0, key)
    arr.splice(j + 1, 1)
    console.log(arr)
  }
}

const arr = [0, 12, 55, 0, 33333, 5, 1, 7, 2, 3, 3]

insertionSort(arr)