升序排列数组

  1. function quickSort(arr) {
  2.   const len = arr.length;
  4.   if (len < 2) {
  5.     return arr;
  6.   }
  8.   const pivot = arr[0];
  9.   let small = [];
  10.   let large = [];
  12.   for (let i = 1; i < len; i++) {
  13.     arr[i] > pivot ? large.push(arr[i]) : small.push(arr[i]);
  14.   }
  16.   return quickSort(small).concat(pivot, quickSort(large));
  17. }

算法测试

  1. console.log(quickSort([5, 8, 1, 4, 3, 0]));
  2. // [ 0, 1, 3, 4, 5, 8 ]
  4. console.log(quickSort([1, 5, 2, 23, 56, 34, 20]));
  5. // [ 1,  2,  5, 20, 23, 34, 56 ]
  7. console.log(quickSort([5, 8, 2, 5, 3, 1]));
  8. // [ 1, 2, 3, 5, 5, 8 ]