JS 插入排序法

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

var Arr = [3, 5, 74, 64, 64, 3, 1, 8, 3, 49, 16, 161, 9, 4]
console.log(Arr, "before");
insertSort(Arr)
console.log(Arr, "after");