該方法在小型項(xiàng)目計(jì)算時(shí)比選擇排序和冒泡排序要好
// 'use strict';
function insertSort (arr) {
let temp
let length = arr.length,j
for(let i = 1; i < length; i ++) {
j = i
temp = arr[i]
while (j > 0 && arr[j-1] > temp) {
arr[j] = arr[j - 1]
j --
}
arr[j] = temp
}
}
let a = [12,2,4,88,50,97]
console.log(a);
insertSort(a)
console.log(a);
