title: Hybrid quicksort+insertion sort in C
body: <p>im asked to do two versions of hybrid quicksort;</p>
  
  <ol>
  <li>When the elements are smaller than 10 call insertion sort to sort each subproblem</li>
  <li>When the elements are smaller than 10, stop quick sort and use insertion sort for the whole unsorted array i got that time.</li>
  </ol>
  
  <p>This is my my quicksort code for the first exercise. I cant seem to find the coding difference between each. I know that's its a very small difference. I tried a lot</p>
  
  <pre><code>void quickSort(int array[], int start, int finish){
      int pivot;
      if ( low &lt; high ){
          pivot = partition(A, start, finish);
          if ((high - low) &lt; 10){
              insertionSort(A, start, finish);
          }
          quickSort(A, low, pivot - 1);
          quickSort(A, pivot + 1, high);
      }
  }
  </code></pre>