3 ms·
It's curious the OP doesn't mention introsort (http://en.wikipedia.org/wiki/Introsort http://en.wikipedia.org/wiki/Introsort). AFAIK most standard libraries use
by shin_lao 15y ago
It's curious the OP doesn't mention introsort (http://en.wikipedia.org/wiki/Introsort http://en.wikipedia.org/wiki/Introsort). AFAIK most standard libraries use introsort instead of quicksort.
Introsort uses heapsort when the recursion is too deep and insertsort when the entry is too small.
- ableal 15y agoThe article seems pretty old - at least from 2004 ( http://wayback.archive.org/web/*/http://www.angelfire.com/pq/jamesbarbetti/articles/sorting/001_QuicksortIsBroken.htm http://wayback.archive.org/web/*/http://www.angelfire.com/pq... ), probably even older. Angelfire was popular in the late 1990s ...