function quickSort(array, low = 0, high = array.length - 1) {
  if (low < high) { // <4>
    const partitionIndex = partition(array, low, high); // <1>
    quickSort(array, low, partitionIndex - 1); // <2>
    quickSort(array, partitionIndex + 1, high); // <3>
  }
  return array;
}
QuickSort - Efficient in-place recursive sorting algorithm.
Avg. Runtime: O(n log n) | Worst: O(n^2)
@param {Number[]} array
@param {Number} low
@param {Number} high