参考Bret Victor 大神
function quickSort(nums) {
if (nums.length <= 1) return nums
const mid = nums.splice(Math.floor(nums.length / 2), 1)[0]
let left = nums.filter(item => item < mid)
let right = nums.filter(item => item >= mid)
return quickSort(left).concat([mid], quickSort(right))
}