Path: utzoo!utgpu!water!watmath!clyde!bellcore!faline!thumper!ulysses!andante!mit-eddie!husc6!bbn!clsib21!ebg From: ebg@clsib21.UUCP Newsgroups: comp.lang.c Subject: Re: Value of microeffiency (was: Re: Optimal ...) Message-ID: <688@clsib21.UUCP> Date: 12 Jul 88 17:25:01 GMT References: <163@navtech.uucp> <2775@ttrdc.UUCP> <164@navtech.uucp> <3693@rpp386.UUCP> <449@proxftl.UUCP> Organization: CLSI Newtonville, Mass Lines: 22 In-reply-to: bill@proxftl.UUCP's message of 11 Jul 88 08:08:29 GMT Posting-Front-End: GNU Emacs 18.41.1 of Sun Feb 28 1988 on clsib21 (berkeley-unix) >> A linked-list sort? >> >> Once upon a time I got very tired of the slowness of the >> UNIX sort program. So I wrote a clone of it. I invented a >> whole new algorithm for it which you could call a >> linked-list merge sort. It beat every other sort method >> that I tested hands-down. Its only drawback is the >> memory for the linked list. (Actually, I'd bet that >> someone invented this sort before me, but at the time, >> I'd never heard of anything like it.) I "invented" the same sort of algorithm when I was working in Fort Lauderdale, only it was because I was tired of storing sorted lists on intermediate files on disk. I've seen nothing on it either since then, maybe someone has a reference. Since it was "invented" in Fort Lauderdale, do we know each other? --ed gordon (data systems associates, 513a ridgefield circle, clinton, MA 01510) .