Date: Thu, 19 Oct 2000 13:56:21 +0200 (CEST)
From: Dieter Demerre <ext DOT dieter DOT demerre AT siemens DOT be>
X-Sender: dd AT baby DOT siemens DOT ebp DOT ii3 DOT b-rail DOT be
To: djgpp AT delorie DOT com
Subject: Re: qsort's algorithm
In-Reply-To: <39eeb9d1.4100836@news.freeserve.net>
Message-ID: <Pine.LNX.4.10.10010191353020.978-100000@baby.siemens.ebp.ii3.b-rail.be>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
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
Precedence: bulk

On Thu, 19 Oct 2000, Steamer wrote:

> Damian Yerrick wrote:
> 
> > The 'q' in qsort() is a red herring.  I haven't read the standard,
> > but AFAIK it only specifies O(n log n).
> 
> It doesn't even specify that.

idd. K&R p. 253 (AppB,Sec6B)
"...
void qsort(void* base, size_t n size_t size, 
	int (*cmp)(const void* keyval, const void* datum))

qsort sorts into ascending order an array base[0]...[base[n-1] of objects
of size size.  The comparison function cmp is as in bsearch.
..."

******* Groetjes vanwege ***** Greetings From *******
Dieter Demerre - http://www.angelfire.com/de/ddemerre
  ddemerre AT acm DOT org - ext DOT dieter DOT demerre AT siemens DOT be

Although this private and confidential e-mail has been sent 
to you through a personal Siemens account, it does NOT 
represent any official opinion of Siemens.

If you are not the intended recipient of this e-mail and 
have received it in error, please notify the sender by 
replying with 'received in error' as the subject and then 
delete it from your mailbox.