JavaScript 快速排序

Question

function quickSort(arr) {
    if (arr.length <= 1) {
        return arr
    }
    const centerIdx = Math.floor(arr.length / 2)
    const center = arr[centerIdx]
    const left = []
    const right = []
    for (let i = 0; i < arr.length; i++) {
        if (i === centerIdx) {
            continue
        }
        if (arr[i] < center) {
            left.push(arr[i])
        } else {
            right.push(arr[i])
        }
    }
    return [...quickSort(left), center, quickSort(right)]
}