[m-dev.] for review: new predicates in map.m

Peter Schachte pets at cs.mu.OZ.AU
Thu Oct 22 10:24:39 AEST 1998

On Wed, Oct 21, 1998 at 11:41:20PM +1000, Andrew Bromage wrote:
> Simplest way to do that is basically to split the list into ascending
> and descending runs, merge each adjacent ascending and reversed-
> descending runs, then bottom-up merge the runs that you get.

That's what SAM sort does.

Peter Schachte                | Don't worry about the world coming to an end
mailto:pets at cs.mu.OZ.AU       | today. It's already tomorrow in Australia.
http://www.cs.mu.oz.au/~pets/ |     -- Charles Schultz 
PGP: finger pets at | 

More information about the developers mailing list