Re:Potential Quicksort replacement in java.util.Arrays with ...
by fhars on Friday September 11, 2009 @12:11PM
(#817586)
With two pivots, you can start the partitioning at either end and have a well defined location for each of the three partitions (at the top, at the botton, and inbetween). With more than three partitions, you would not know where to put the second to second last border without first sorting the array. You could just guess, but that would probably result in quite a lot of additional array shifting (lucky if you have a dedicated blitter chip for that :-)).
[ Parent
| on HN ]
There are no comments on this comment yet.