Value of microeffiency (was: Re: Optimal ...)

Jon Zeeff zeeff at b-tech.UUCP
Thu Jul 14 01:41:03 AEST 1988


In article <688 at clsib21.UUCP> ebg at 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 at umix.cc.umich.edu



More information about the Comp.lang.c mailing list