3 ms·
In which case they cease to be quicksort, and are instead called "introsort": http://en.wikipedia.org/wiki/Introsort http://en.wikipedia.org/wiki/Introsort
by jemfinch 16y ago
In which case they cease to be quicksort, and are instead called "introsort": http://en.wikipedia.org/wiki/Introsort http://en.wikipedia.org/wiki/Introsort
- pbiggar 16y agoMy point was that we should give good hackers the benefit of the doubt when they say quicksort, as they are likely to actually be talking about introsort. GNU C uses introsort to implement qsort, and if I were to implement quicksort for an important job, I certainly wouldn't overlook the fact that it can run to O(N^2).