排序算法之冒泡排序 发表于 2020-01-07 | 更新于 2020-01-08 | 分类于 算法 插入排序1234567891011121314const insertionSort = arr => { for (let i = 1; i < arr.length; i++) { let temp = arr[i] let j = i while(temp < arr[j - 1] && j > 0) { arr[j] = arr[j - 1] j-- } arr[j] = temp } return arr}