Path: utzoo!attcan!uunet!lll-winken!lll-tis!ames!mailrus!b-tech!zeeff From: zeeff@b-tech.UUCP (Jon Zeeff) Newsgroups: comp.lang.c Subject: Re: Value of microeffiency (was: Re: Optimal ...) Message-ID: <4616@b-tech.UUCP> Date: 13 Jul 88 15:41:03 GMT References: <163@navtech.uucp> <2775@ttrdc.UUCP> <164@navtech.uucp> <3693@rpp386.UUCP> <449@proxftl.UUCP> <688@clsib21.UUCP> Reply-To: zeeff@b-tech.UUCP (Jon Zeeff) Organization: Branch Technology Ann Arbor, MI Lines: 24 In article <688@clsib21.UUCP> ebg@clsib21.UUCP (Ed Gordon) writes: > >>> 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 If it's that good, perhaps someone could post a copy to comp.unix.sources, preferably in a form that is a plug in replacement for qsort(). -- Jon Zeeff Branch Technology, uunet!umix!b-tech!zeeff zeeff%b-tech.uucp@umix.cc.umich.edu