快速排序算法JS实现

function quickSort(arr, low, high){
      let i = low; //哨兵
      let j = high;//哨兵
      let pivot = arr[low];
      if(i >= j) {
        return;
      }
      while(i != j){
        while(i < j && arr[j] >= pivot)
          j--;
        while(i < j && arr[i] <= pivot)
          i++;
        if(i < j) {
          let temp = arr[j];
          arr[j] = arr[i];
          arr[i] = temp;
        }
      }
      arr[low] = arr[i];//每一次排序后将基准点放在正确的位置
      arr[i] = pivot;
      quickSort(arr, low, i -1);
      quickSort(arr, i + 1, high);
}
function quickSort(arr, low, high){
      l