Path: utzoo!attcan!uunet!lll-winken!lll-lcc!ames!ucsd!chem.ucsd.edu!tps From: tps@chem.ucsd.edu (Tom Stockfisch) Newsgroups: comp.lang.c Subject: Re: Value of microeffiency (was: Re: Optimal ...) Message-ID: <255@chem.ucsd.EDU> Date: 16 Jul 88 02:25:58 GMT References: <163@navtech.uucp> <2775@ttrdc.UUCP> <164@navtech.uucp> <4616@b-tech.UUCP> <472@proxftl.UUCP> Reply-To: tps@chem.ucsd.edu (Tom Stockfisch) Organization: Chemistry Dept, UC San Diego Lines: 14 In article <472@proxftl.UUCP> bill@proxftl.UUCP (T. William Wells) writes: >In article <4616@b-tech.UUCP>, zeeff@b-tech.UUCP (Jon Zeeff) writes: >) In article <688@clsib21.UUCP> ebg@clsib21.UUCP (Ed Gordon) writes: >) >>> [I wrote a much-faster clone of qsort() using linked-lists] > However, I might go ahead and >publish it. There is one minor gotcha: the drawback, not copied >in the message above, is that the routine has got to get memory >for the linked list. Rewrite your interface so that the user must supply the memory for the linked list and free it himself, so that if allocation/deallocation is an issue, the user can handle it. -- || Tom Stockfisch, UCSD Chemistry tps@chem.ucsd.edu