如何使我的排序函数尾递归？

function quickSort(arr) {
  return tailRecursiveSort(arr, 0, arr.length - 1);
}

function tailRecursiveSort(arr, start, end) {
  while (start < end) {
    let pivotIndex = partition(arr, start, end);
    if (pivotIndex - start < end - pivotIndex) {
      tailRecursiveSort(arr, start, pivotIndex - 1);
      start = pivotIndex + 1;
    } else {
      tailRecursiveSort(arr, pivotIndex + 1, end);
      end = pivotIndex - 1;
    }
  }
  return arr;
}

function partition(arr, start, end) {
  let pivot = arr[start];
  let left = start + 1;
  let right = end;
  while (left <= right) {
    if (arr[left] <= pivot) {
      left++;
    } else if (arr[right] >= pivot) {
      right--;
    } else {
      swap(arr, left, right);
      left++;
      right--;
    }
  }
  swap(arr, start, right);
  return right;
}

function swap(arr, i, j) {
  let temp = arr[i];
  arr[i] = arr[j];
  arr[j] = temp;
}