js实现快速排序

const testArr = [3,3,3,3,3]

function sort(arr){
    if(arr.length <=1) return arr;
    //获取中间值
    const centerIndex = Math.floor(arr.length/2)
    const centerValue = arr.splice(centerIndex,1)[0]
    const leftArr = [];
    const rightArr = [];
    for(let i = 0;i<arr.length; i++){
        if(arr[i] <= centerValue){
            leftArr.push(arr[i])
        } else {
            rightArr.push(arr[i])
        }
    }
    return sort(leftArr).concat([centerValue],sort(rightArr))
}

console.log(sort(testArr))