结构-行为-样式-Js排序算法之 快速排序

var arrs = [23,85,61,37,55,12,63,11,99,39,70,21,23];
function QuickSort(arr , s,e){
    var len = e;
    var token = arr[s];
    for(var i=s+1;i<=len;i++){
        var ttt = arr[i];
        if(token >= arr[i]){
            var temp = arr[i];
            for(var k = i;k>s;k--){
                arr[k] = arr[k-1];
            }
            arr[s] = temp;
            s++;
        }
    }
    return s;
}

function sort(arrs,s,e){
    var t = QuickSort(arrs,s,e);
    if(t-1 >= s ){
        sort(arrs , s,t-1);
    }
    if(t+1 <= e){
        sort(arrs , t+1,e);
    }
}
    
sort(arrs,0,arrs.length);

document.getElementById("app").innerHTML = arrs+"";