code: public void quickSort(int left, int right) {
          if (left + 10 <= right) {
              int partitionIndex = partition(left, right);
              quickSort(left, partitionIndex - 1);
              quickSort(partitionIndex, right);
          } else {
              // Do an insertion sort on the subarray
              insertionSort(left, right);
          }
      }
docs: Quicksort for ranges. The bounds specify which part of the array is to be sorted.<br />
  <br />
  Algorithm of O( n*log(n) ) asymptotic upper bound. <br />
  This version of quicksort also allows for bounds to be put in to specify what part of the array will be sorted. <br />
  The part of the array that lies between <b>left</b> and <b>right</b> is the only part that will be sorted.
  
  @param left
  The left boundary of what will be sorted.
  @param right
  The right boundary of what will be sorted.