quicksort.js

function bigBoySort(arr) {
    if (arr.length < 2) {
        return arr;
    }

    let p = arr[0];
    let lo = [];
    let hi = [];

    for (let i = 1; i < arr.length; i++) {
        if (arr[i] > p) {
            hi.push(arr[i]);
        } else {
            lo.push(arr[i]);
        }
    }

    return [...bigBoySort(lo), p, ...bigBoySort(hi)];
};

const babySort = (arr) => arr.sort();

function babySort(arr) {
return arr.sort();
}