JS的三种排序方式：冒泡、快速、归并

不多说，看代码！

let a=[5,3,6,2,1,9,4,8,7,10,12,11,39,0];
let b=[...a]; //数组的扩展符
let c=[...a];

//冒泡排序
function bubble(a) {
    if (a.length===0){
        console.log('数组为空！');
    }
    let count=0;
    for (let i=0;i<a.length;i++){
        for (let j=0;j<a.length+1;j++){
            if (a[i]<a[j]){
                console.log(i+":"+j);
               [a[i],a[j]]=[a[j],a[i]];
               count++;
            }
        }
    }
   return {a:a,b:count};
}
//快速排序
function quickSort(a) {
    if (a.length<=1){
        return a;
    }
    let mid=Math.floor(a.length/2);
    let midValue=a.splice(mid,1);
    let left=[];
    let right=[];
    for (let i=0;i<a.length;i++){
        if (a[i]<midValue){
            left.push(a[i]);
        }else {
            right.push(a[i]);
        }

    }
    return quickSort(left).concat(midValue,quickSort(right))

}
//归并排序
function mergeSort(a) {
    if (a.length<=1){
        return a;
    }
    let mid=Math.floor(a.length/2);
    let left_a=a.slice(0,mid);
    let right_a=a.slice(mid);
    return merge(mergeSort(left_a),mergeSort(right_a));
}
function merge(left, right) {
    let result=[];
    while (left.length>0&&right.length>0){
        if (left[0]<right[0]){
            result.push(left.shift());
        }else {
            result.push(right.shift());
        }
    }
    return result.concat(left).concat(right);
}

console.log('冒泡排序：'+bubble(a).a+'\t'+'排了'+bubble(a).b+'次');
console.log('快速排序：'+quickSort(b));
console.log("归并排序："+mergeSort(c));

运行结果：

冒泡排序：0,1,2,3,4,5,6,7,8,9,10,11,12,39 排了26次
快速排序：0,1,2,3,4,5,6,7,8,9,10,11,12,39
归并排序：0,1,2,3,4,5,6,7,8,9,10,11,12,39