快速排序、归并排序、插入排序[二分法，递归等]

var quickSort = function (arr) {
  if (arr.length <= 1) { return arr; }
  // if (arr.length === 2) { return arr[0] > arr[1] ? arr : [arr[1], arr[0]] }
  var pivot = arr.splice(0, 1)[0];
  var left = [];
  var right = [];
  for (var i = 0; i < arr.length; i++) {
    arr[i] > pivot ? left.push(arr[i]) : right.push(arr[i]);
  }
  return quickSort(left).concat(pivot, quickSort(right));
};
let att = []

for (let index = 0; index < 90000; index++) {
  att.push(Math.random() * index)

}

console.log(quickSort(att));

function insertionSort(arr) {
  var len = arr.length;
  var preIndex, current;
  for (var i = 1; i < len; i++) {
    preIndex = i - 1;
    current = arr[i];
    while (preIndex >= 0 && arr[preIndex] < current) {
      arr[preIndex + 1] = arr[preIndex];
      preIndex--;
    }
    arr[preIndex + 1] = current
  }
return arr
}

console.log(insertionSort([30, 5, 624, 6]));

function mergeSort(arr) { 

  var len = arr.length;
  if (len < 2) {
    return arr;
  }
  var middle = Math.floor(len / 2),
    left = arr.slice(0, middle),
    right = arr.slice(middle);
  return merge(mergeSort(left), mergeSort(right));
}

function merge(left, right) {
  var result = [];
  while (left.length && right.length) {
    if (left[0] >= right[0]) {
      result.push(left.shift());
    } else {
      result.push(right.shift());
    }
  }
  while (left.length)
    result.push(left.shift());

  while (right.length)
    result.push(right.shift());

  return result;
}