编辑代码

const quickSort = (arr: number[]): number[] => {
    const sort = (left: number, right: number) => {
        if(left >= right) return
        let i = left, j = right
        let base = arr[j]
        while(i < j) {
            while(i < j && arr[i] <= base) i ++
            arr[j] = arr[i]
            while(i < j && arr[j] >= base) j --
            arr[i] = arr[j]
        }
        arr[j] = base
        sort(left, j-1)
        sort(j+1, right)
    }
    sort(0, arr.length-1)
    return arr
}


console.log(quickSort([6,3,1,6,9,3,23,4,6,8,2,1]))