插入排序：
var a = [1,7,4,2,17,13,9]
function insertionSort(arr){
arr.map((d,index)=>{
let i = index
while(d0){
[arr[i-1],arr[i]]=[arr[i],arr[i-1]]
i--
}
})
}
insertionSort(a)
歸并排序（非hack）
function merge (arr,l,m,r){
var left = []
var right = []
for (let i =l;i
}
function mergeSort(arr,l,r){
if(r>l){
var m=Math.ceil((l+r)/2)
// console.log(m)
mergeSort(arr,l,m-1)
mergeSort(arr,m,r)
merge(arr,l,m,r)
}
}
歸并排序（酷炫簡(jiǎn)單）
function merge(left, right) {
var tmp = [];
while (left.length && right.length) {
if (left[0] < right[0])
tmp.push(left.shift());
else
tmp.push(right.shift());
}
return tmp.concat(left, right);
}
function mergeSort(a) {
if (a.length === 1)
return a;
var mid = ~~(a.length / 2)
, left = a.slice(0, mid)
, right = a.slice(mid);
return merge(mergeSort(left), mergeSort(right));
}
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/102406.html
