A simple quicksort, that when the amount of recursive calls becomes larger than the log2(length of the subarray) it will call a heapsort for that subarray.