quickSort.js

/**
 * 快速排序
 * @param {Array} array - 乱序数组
 */
function quickSort (array) {
  if (0 === array.length) { return array; }
  let key = array.shift();
  let lessers = [];
  let greaters = [];
  for (let i = 0, item = null; item = array[i]; i++) {
    item < key ? lessers.push(item) : greaters.push(item);
  }
  return [...quickSort(lessers), key, ...quickSort(greaters)];
}