Here is what a human did: It begins with quicksort, it switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of

Here is what a human did: It begins with quicksort, it switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted and it switches to insertion sort when the number of elements is below some threshold. I think machines can do this too.