Re:Wolfsort: An ultra-fast hybrid radix sort algorithm
by cheez on Saturday July 25, 2020 @09:46AM
(#23949130)
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.
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.