var arr = [2, 5, 7, 2, 6, 0, 1]
// 快速排序
function quickArr(arr) {
var left = [];
var right = [];
if (arr.length <= 1) {
return arr;
}
var pIndex = Math.floor(arr.length / 2);
var p = arr.splice(pIndex, 1)[0]//作为比较的基准值
for (var i = 0; i < arr.length; i++) {
if (arr[i] < p) {
left.push(arr[i])
} else {
right.push(arr[i])
}
}
return quickArr(left).concat([p], quickArr(right));
}
console.log(quickArr(arr))
错误“栈溢出”,出错原因:递归算法忘记添加判断条件,导致递归死循环