javascript版本的插入排序

function insertionSort(arr) {
  const len = arr.length
  let preIndex, current
  for(let i = 1; i < len; i++){
    preIndex = i -1
    current = arr[i]
    while(preIndex >= 0 && arr[preIndex] > current) {
      arr[preIndex + 1] = arr[preIndex]
      preIndex--
    }
    arr[preIndex + 1] = current
  }
  return arr
}

const arr = [3,8,9,10,6,4]
console.log(insertionSort(arr))