Replacement of Quicksort in java.util.Arrays with new Dual-Pivot Quicksort

Oleg Anashkin oleg.anashkin at gmail.com
Sun Sep 13 16:32:09 UTC 2009


Hello Vladimir,

First thing that came to mind - have you thought about extrapolating this
approach to more pivots? If 2-pivot algorithm is faster than 1-pivot, then
3-pivot might be even faster, right? Can the number of pivots be chosen as a
function of array size (to mitigate overhead)?

Thanks,
Oleg




More information about the core-libs-dev mailing list