编辑代码

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

let arr = [5, 1, 2, 88, 46]
insertSort(arr)
console.log(arr)