Date:	Mon, 23 Oct 2000 13:45:00 +0200 (IST)
From:	Eli Zaretskii <eliz AT is DOT elta DOT co DOT il>
X-Sender:	eliz AT is
To:	Horst Kraemer <horst DOT kraemer AT gmx DOT de>
cc:	djgpp AT delorie DOT com
Subject:	Re: qsort's algorithm
In-Reply-To:	<39f35c64.3093928@news.cis.dfn.de>
Message-ID:	<Pine.SUN.3.91.1001023134442.13851L-100000@is>
MIME-Version:	1.0
Reply-To:	djgpp AT delorie DOT com
Errors-To:	nobody AT delorie DOT com
X-Mailing-List:	djgpp AT delorie DOT com
X-Unsubscribes-To:	listserv AT delorie DOT com

On Mon, 23 Oct 2000, Horst Kraemer wrote:

> DJGPP's qsort doesn't perform worse with already (almost) sorted data.
> According to my experience it has a big performance problem if the
> number of keys to be sorted is small w.r.t. to the number of items.

Did you try that with qsort from djdev203.zip?  The algorithm has
changed since previous versions.

- Raw text -