Nuke it if there isn't an obvious need for the code. (my opinion anyway)
On Wed, Dec 30, 2009 at 6:10 PM, Benson Margulies <[email protected]>wrote: > Folks, > > GenericSorting contains quick and merge sorts where the sort procedure > has no direct access to the data. It takes a swapper and a comparator, > and the idea is that the comparator takes the indices and uses them to > look in some mysterious place. > > I am not understanding the implementation of quicksort, which is doing > things with the indices which I would expect to require access to the > values. Something tells me that this is old news. > > --benson > -- Ted Dunning, CTO DeepDyve
