function quickSort(arr) {
if (arr.length < 2)
return arr
let [first, ...rest] = arr
let left = []
let right = []
for (let i = 0; i < rest.length; ++i) {
if (rest[i] < first)
left.push(rest[i])
else
right.push(rest[i])
}
return [...quickSort(left), first, ...quickSort(right)]
}
复制代码
转载于:https://juejin.im/post/5bddba24518825171318ef4b