var quickSort = function(arr) {
if (arr.length<= 1) return arr;
var pivotIndex = Math.floor(arr.length/ 2);
var pivot = arr.splice(pivotIndex, 1); //删除数组中的基数项,并在下面加入循环
var left = [];
var right = [];
for (var i = 0; i < arr.length; i++) {
if (arr[i] < pivot) {
left.push(arr[i]);
} else {
right.push(arr[i]);
}
}
return quickSort(left).concat([pivot], quickSort(right));
}
转载于:https://my.oschina.net/291277/blog/648469