john at repetae.net
Thu Jan 19 20:19:45 EST 2006
On Thu, Jan 19, 2006 at 10:29:20AM +0100, 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
> > lists?
> Sort by head, then recursively sort the tails each bucket?
yeah, that is the algorithm I am thinking of. but I was curious if
someone has already done the nitty gritty work of actually coming up
with a super-optimized version with all the tweaks due to careful
profiling and whatnot.
John Meacham - ⑆repetae.net⑆john⑈
More information about the Libraries