Date: Wed, 18 Aug 1999 21:53:11 -0700 From: John-Mark Gurney <gurney_j@efn.org> To: Christopher Seiwald <seiwald@perforce.com> Cc: freebsd-hackers@FreeBSD.ORG Subject: Re: anybody love qsort.c? Message-ID: <19990818215311.49180@hydrogen.fircrest.net> In-Reply-To: <199908182356.QAA09187@perforce.com>; from Christopher Seiwald on Wed, Aug 18, 1999 at 04:56:48PM -0700 References: <199908182356.QAA09187@perforce.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Christopher Seiwald scribbled this message on Aug 18: > It's a pretty straightforward change to bypass the insertion sort for > large subsets of the data. If no one has a strong love for qsort, I'll > educate myself on how to make and contribute this change. why don't you implement this w/ the 5 element median selection qsort algorithm? my professor for cis413 talked about this algorithm and that it really is the fastest qsort algorithm... I don't have any pointers to a paper on this... but I might be able to dig some info up on it if you are interested... -- John-Mark Gurney Voice: +1 541 684 8449 Cu Networking P.O. Box 5693, 97405 "The soul contains in itself the event that shall presently befall it. The event is only the actualizing of its thought." -- Ralph Waldo Emerson To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?19990818215311.49180>