4 ms·
Quicksort should be the first sort you try on your rando dataset. The native search implementation is nearly always competitive with the best algorithm for you
by josephv 9y ago
Quicksort should be the first sort you try on your rando dataset. The native search implementation is nearly always competitive with the best algorithm for your particular lunch. And it can be tweaked to specialize on datasets.
- fnbr 9y agoHow can you tweak it to specialize?
- slaymaker1907 9y agoProbably on how you select your pivot.
- thethirdone 9y ago> The native search implementation is nearly always competitive with the best algorithm for your particular lunch. Did you mean "The native sort implementation"? Also "lunch"?