jmaessen at alum.mit.edu
Wed Jan 25 10:08:35 EST 2006
On Jan 19, 2006, at 4:29 AM, Ketil Malde wrote:
> John Meacham <john at repetae.net> 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
> 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.
> If I haven't seen further, it is by standing in the footprints of
> Libraries mailing list
> Libraries at haskell.org
More information about the Libraries