Replacement of Quicksort in java.util.Arrays with new Dual-Pivot Quicksort
Leonid Geller
lgeller at feedroom.com
Fri Sep 11 19:14:16 UTC 2009
As an observation, why not expand the new algorithm to N-Pivot
where N = round(ln(array length)).
This should lower the average sort cost even lower.
More information about the core-libs-dev
mailing list