I think with 10+ elements already quicksort can pay off.
In U++, we maintain 16 as threshold.
Quote:
A well implemented quicksort will not hurt even with 2-3 elements that much.
There is only so much you can do with plain quicksort. All real quicksort algorithms switch to selection sort or insert sort when subsequence goes under certain threshold. It makes it quite faster.
Thus, if I could invent some faster variant for up to 16 elements, we would have a huge win...
Members
Pages
Help
Register
Login
Home
