SOURCE

function quickSort(arr) {
    if (arr.length <= 1) {
        return arr;
    }
    const midIndex = Math.floor(arr.length / 2);
    const mid = arr[midIndex];
    const left = [];
    const right = [];
    for (let i = 0; i < arr.length; i++) {
        if (i !== midIndex) {
            if (arr[i] < mid) {
                left.push(arr[i]);
            } else {
                right.push(arr[i]);
            }
        }
    }
    return quickSort(left).concat([mid], quickSort(right));
}
const array = [1,23,4,51,23,6,7,1,23,5,1,2,3,99,100,22,33]

console.log(quickSort(array))