编辑代码

var arr = [0,5,6,3,2,7,9,1,6];

function quickSort(arr) {

    const len = arr.length;

    if (len < 2) {
        return arr;
    }

    let base = arr[len - 1];

    const left = [];
    const right = [];

    for (let i = 0; i < len - 1; i++) {
        if (arr[i] < base) {
            left.push(arr[i]);
        } else {
            right.push(arr[i]);
        }
    }


    return quickSort(left).concat(base, quickSort(right));

}

const res = quickSort(arr);

console.log(res, arr);