This is doable, but the risk is that looking at the numbers might take longer th... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		xyproto on July 25, 2020 \| parent \| context \| favorite \| on: Wolfsort: An ultra-fast hybrid radix sort algorith... This is doable, but the risk is that looking at the numbers might take longer than just sorting them, even with a sub optimal algorithm. I guess someone will just have to try this.

cheez on July 25, 2020 [–]

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.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact