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

[Leonid Geller]

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.