Date: Wed, 2 Jul 1997 07:20:49 -0500 (CDT)
From: Andrew Deren <aderen AT eecs DOT uic DOT edu>
To: Benjamin D Chambers <chambersb AT juno DOT com>
cc: djgpp AT delorie DOT com
Subject: Re: QSort speed?
In-Reply-To: <19970701.100927.5183.0.chambersb@juno.com>
Message-ID: <Pine.SUN.3.95.970702072012.1294A-100000@bert.eecs.uic.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Precedence: bulk

If you are using linked lists I would recommed using MergeSort, it's
really fast.

On Tue, 1 Jul 1997, Benjamin D Chambers wrote:

> Generally, is qsort pretty fast?
> 
> I had been planning to sort my list using a double linked list, starting
> each time from the previously entered element (since elements tend to
> come in bunches near each other), but would the effort be worth it when I
> could use qsort?  (Or am I going to get the standard "Time it and see"
> answer? :)
> 
> ...Chambers
>