# 快速排序 ```javascript function quickSort(arr) { const length = arr.length; if (length <= 1) return arr; const midIndex = Math.floor(length / 2); const midItem = arr[midIndex]; const left = [], right = []; for (let i = 0; i < length; i++) { if (arr[i] < midItem) { left.push(arr[i]) } if (arr[i] > midItem) { right.push(arr[i]); } } return quickSort(left).concat([midItem], quickSort(right)) } console.log(quickSort([1,4,6,2,0])); ```