Re:Quicksort (1961) [pdf]
by josephv on Wednesday October 11, 2017 @12:12PM
(#15450849)
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.
[ Parent
| on HN ]
Re:Quicksort (1961) [pdf]
by thethirdone on Wednesday October 11, 2017 @05:43PM
(#15453757)
> 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"?
How can you tweak it to specialize?
Re:Quicksort (1961) [pdf]
by slaymaker1907 on Wednesday October 11, 2017 @05:43PM
(#15453756)
Probably on how you select your pivot.