版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/HCJS_Zee/article/details/83272507
function quickSort(arr){
var arrLeft = [],
arrRight = [],
arrLen = arr.length,
pointIndex = parseInt(arrLen / 2),
point = arr[pointIndex];
for(var i = 0; i < arrLen; i++){
if(i === pointIndex){
continue;
}
if(arr[i] < point){
arrLeft.push(arr[i]);
} else {
arrRight.push(arr[i]);
}
}
return quickSort(arrLeft).concat(point, quickSort(arrRight));
}