Re: list sorting

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? -k -- If I haven't seen further, it is by standing in the footprints of giants