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

> Vadim-It would be very interesting if something along these lines could be made practical.  It isn't obvious how to do step (3) in place.  Either you end up allocating extra storage to do it, in which case you might as well have used a merge sort, or you end up doing some extra shuffling aroun

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

ivot elements should provide a savings. Vadim Ponomarenko Dept. of Mathematics and Statistics San Diego State University