Newsgroups: comp.sys.mac.programmer.help,comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!uw-beaver!news.u.washington.edu!phase2.worldnet.att.net!feed1.news.erols.com!howland.erols.net!netcom.com!ejr
From: ejr@netcom.com (Erik J. Rogers)
Subject: Re: Mergesort: why's it efficient?
Message-ID: <ejrE1twH2.70u@netcom.com>
Followup-To: comp.sys.mac.programmer.help,comp.lang.lisp
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
X-Newsreader: TIN [version 1.2 PL1]
Date: Tue, 3 Dec 1996 08:19:50 GMT
Lines: 11
Sender: ejr@netcom.netcom.com
Xref: glinda.oz.cs.cmu.edu comp.sys.mac.programmer.help:44436 comp.lang.lisp:23999

I know this might belong in another thread (or group for that matter),
but I think here it targets those interested more closely, and it does
relate to the original topic...

* What is a good book/text on such theory (search/sort & other basics)?
I could easily find something suitable, but perhaps there are some that
come with stronger recommendations than others.

Thanks,

Erik J. Rogers
