Quicksort in JavaScript

qs.js

const qs = (compare, list) => {
    if (list.length < 2) {
        return list
    }
    const pivot = list[0]
    const left = []
    const right = []

    for (const item of list.slice(1)) {
        compare(pivot, item) ? left.push(item) : right.push(item)
    }
    
    return qs(compare, left).concat([pivot]).concat(qs(compare, right))
}

qs((a, b) => a > b, [0,9,3,4,1,2,5,7,6,8])