Re: list sorting

On Jan 19, 2006, at 4:29 AM, Ketil Malde wrote:

John Meacham writes:

...

is there a function floating around for _efficiently_ sorting a list of lists that will not evaluate any more of the lists than is needed to sort them properly and does not re-compare the common prefix of said lists?

Sort by head, then recursively sort the tails each bucket?

On a related note, a carefully-tweaked implementation of group . sort would be really handy, and just what the doctor ordered in this case. -Jan-Willem Maessen

-k -- If I haven't seen further, it is by standing in the footprints of giants

_______________________________________________ Libraries mailing list Libraries@haskell.org http://www.haskell.org/mailman/listinfo/libraries