News for hackers. Stuff that matters.
Re:Potential Quicksort replacement in java.util.Arrays with ... by iclelland on Friday September 11, 2009 @12:20PM (#817604)
Having N > 1 requires you to do a sort on the pivots. From the algorithm:

  3. P1 must be less than P2, otherwise they are swapped.

There are no comments on this comment yet.