javascirpt算法实现之快速排序

目标：用最少的代码去实现完整的功能

const quicksort = (arr)=>{
    if(arr.length<2)return arr
    const base = arr[0]
    const lt = []
    const gt = []
    arr.slice(1).forEach(e => {
        e<base?lt.push(e):gt.push(e)
    });
    return [...quicksort(lt),base,...quicksort(gt)]
}