Using Heapsort And Quicksort Together

I have to use both heap sort and quick sort so that it switches to a heap sort implementation when the recursion depth exceeds the log base of 2 of the size of the original list. M

Solution 1:

You start quipSortRec fine, but the else should look like a copy of quickSort with the recursive calls now calling quipSortRec.