几种常见的排序

冒泡排序

function arr_sort(arr){
    for(let i = 0;i<arr.length-1;i++){  //一共几轮
        for(let j = 0;j<arr.length-i;j++){  //每轮几次
            if(arr[j]>arr[j+1]){
                //把大的数字放到后面
                var swap = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = swap;
            }
        }
    }
}

https://www.cnblogs.com/bigdata-stone/p/10464243.html

选择排序

// 选择排序
function arr_sort(arr){
    for(let i = 0;i<arr.length-1;i++){  //几轮
        for(let j = i+1;j<arr.length;j++){
            if(arr[i] > arr[j]){
                var swap = arr[i];
                arr[i] = arr[j];
                arr[j] = swap;
            }
        }
    }
}

https://www.runoob.com/w3cnote/selection-sort.html

快速排序

function quick_sort(arr){
    if(arr.length <= 1){ //递归出口
        return arr;
    }

    let standard = arr[Math.floor(arr.length/2)]; //取一个基准
    let left = [],right = [];

    for(let i = 0;i<arr.length;i++){
        if(arr[i]>=standard){
            left.push(arr[i]);
        }else{
            right.push(arr[i]);
        }
    }
    let zArr = quick_sort(left).concat([standard],right);
    return zArr;
}

http://www.ruanyifeng.com/blog/2011/04/quicksort_in_javascript.html