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

Remarkable performance improvements! The next step to make this "jdk" material is to implement the DPQ using collections and generics. Then offer an API to pass a comparator class or insure the sortable data structure implements comparable interface.

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

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.