Quick rehearsal exercise

function sort(array) {
  if (!checkArray(array)) return
  quickSort(array, 0, array.length - 1);
  return array;
}

function quickSort(array, left, right) {
  if (left < right) {
    swap(array, , right)
    //  Random value , Then swap with the end , This is slightly less complex than taking a fixed position 
    let indexs = part(array, parseInt(Math.random() * (right - left + 1)) + left, right);
    quickSort(array, left, indexs[0]);
    quickSort(array, indexs[1] + 1, right);
  }
}
function part(array, left, right) {
  let less = left - 1;
  let more = right;
  while (left < more) {
    if (array[left] < array[right]) {
      //  The current value is smaller than the reference value ,`less`  and  `left`  All plus one 
	   ++less;
       ++left;
    } else if (array[left] > array[right]) {
      //  The current value is larger than the reference value , Swap the current value with the value on the right 
      //  And don't change  `left`, Because the current value has not been judged 
      swap(array, --more, left);
    } else {
      //  Same as the reference value , Move subscript only 
      left++;
    }
  }
  //  Exchange the reference value with the first value larger than the reference value 
  //  So the array becomes  `[ Less than the reference value ,  At baseline ,  Greater than the benchmark value ]`
  swap(array, right, more);
  return [less, more];
}