NodeJS实现快速排序算法

function quickSort(arr) {
    if (arr.length <= 1) {
        return arr;
    }
    
    const pivot = arr[0];
    const left = [];
    const right = [];
    
    for (let i = 1; i < arr.length; i++) {
        if (arr[i] < pivot) {
            left.push(arr[i]);
        } else {
            right.push(arr[i]);
        }
    }
    
    return quickSort(left).concat(pivot, quickSort(right));
}
// 测试
let arr = [64, 25, 12, 22, 11];
console.log("排序前：", arr);
arr = quickSort(arr);
console.log("排序后：", arr);