分享四个常见的代码简洁的排序模板（快排、归并、希尔、堆）

排序

快速排序

const quick_sort = function(arr,l,r){
    if(l>=r) return;
    let x = arr[l],i=l-1,j=r+1;
    while(i<j){
        do i++ ; while(arr[i]<x);
        do j-- ; while(arr[j]>x);
        if(i<j) [arr[i],arr[j]]=[arr[j],arr[i]];
    }
    quick_sort(arr,l,j)
    quick_sort(arr,j+1,r)
    return arr
}

归并排序

const merge_sort = function(arr,l,r,tmp=[]){
    if(l>=r) return;
    let mid = (l+r) >> 1;
    merge_sort(arr,l,mid),merge_sort(arr,mid+1,r);
    let k = 0,i = l , j =mid+1;
    while(i <= mid && j <=r)
        if(arr[i] <= arr[j]) {tmp[k++] = arr[i++];}
        else {tmp[k++] = arr[j++];}
    while(i<=mid) tmp[k++] = arr[i++];
    while(j<=r) tmp[k++] = arr[j++];
    for(i= l, j=0;i<=r;i++,j++) arr[i]=tmp[j];
}

希尔排序

function shell_sort(arr,len){
    let j,d=len>>1,tmp;
    while(d>0){
        for(let i = d ; i < len ; i++){
            tmp = arr[i];
            j = i-d;
            while(j>=0&&tmp>arr[j]){
                arr[j+d] = arr[j];
                j = j - d;
            }
            arr[j+d] = tmp;
        }
        d>>=1;
    }
}
let arr = [23,43,1,34,54,23,65,78,9]
shell_sort(arr,arr.length)
console.log(arr)

堆排序

function down(u,len){
    let t = u;
    if(u*2<=len&&arr[u*2]>arr[t]) t=u*2;
    if(u*2+1<=len&&arr[u*2+1]>arr[t]) t=u*2+1;
    if(t!=u){
        [arr[u],arr[t]]= [arr[t],arr[u]]
        down(t,len);
    }
}
let arr = [23,43,1,34,54,23,65,78,9]
arr.unshift(0);
len = arr.length-1
for(let i = (len>>1);i>0;i--) down (i,len); //以O(n)的复杂度建堆
for(let i = len ; i >= 2 ; i--) {  //
    [arr[1],arr[i]] = [arr[i],arr[1]]
    down(1,i-1);
}
arr.shift();
console.log(arr)