带你读《图解算法小抄》十四、排序（11）

const INSERTION_THRESHOLD = 10;
function insertionSort(arr, start, end) {
  for (let i = start + 1; i <= end; i++) {
    const current = arr[i];
    let j = i - 1;
    while (j >= start && arr[j] > current) {
      arr[j + 1] = arr[j];
      j--;
    }
    arr[j + 1] = current;
  }}
function quickSortOptimized(arr, start = 0, end = arr.length - 1) {
  if (end - start + 1 <= INSERTION_THRESHOLD) {
    insertionSort(arr, start, end);
  } else {
    const pivotIndex = partition(arr, start, end);
    quickSortOptimized(arr, start, pivotIndex - 1);
    quickSortOptimized(arr, pivotIndex + 1, end);
  }
  return arr;
}