Date: Thu, 19 Aug 1999 11:10:13 -0700 (PDT) From: Archie Cobbs <archie@whistle.com> To: narvi@haldjas.folklore.ee (Narvi) Cc: seiwald@perforce.com (Christopher Seiwald), freebsd-hackers@FreeBSD.ORG Subject: Re: anybody love qsort.c? Message-ID: <199908191810.LAA94818@bubba.whistle.com> In-Reply-To: <Pine.BSF.3.96.990819181348.19879V-100000@haldjas.folklore.ee> from Narvi at "Aug 19, 1999 06:16:38 pm"
next in thread | previous in thread | raw e-mail | index | archive | help
Narvi writes: > Doesn't the qsort just switch to isort *if* the partition to sort is short > enough? That's exactly Christopher's point. It should do this but it doesn't. The code is complex but from a quick glance it appears that the decision to switch to insertion sort does not depend on the total array length. -Archie ___________________________________________________________________________ Archie Cobbs * Whistle Communications, Inc. * http://www.whistle.com 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?199908191810.LAA94818>