Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
To: Archee/CoNTRACT <01dsolt AT gondolat DOT vpg DOT hu>,
        Eli Zaretskii <eliz AT is DOT elta DOT co DOT il>
From: Nate Eldredge <nate AT cartsys DOT com>
Subject: Re: Library Function qsort() Exhibits N^2 Behavior
Cc: Kbwms <Kbwms AT aol DOT com>, djgpp AT delorie DOT com
Date: Wed, 29 Apr 1998 15:47:23 -0700
Message-ID: <19980429224701.AAE11144@ppp123.cartsys.com>
Precedence: bulk

At 03:12  4/29/1998 +0200, Archee/CoNTRACT wrote:
>hi !
>
>try it out:
>gcc -S sqrt.c
>gcc -S -O9 sqrt.c
>
>You can see the difference. Yes, it is really slow.
>You have to make another sqrt function. A simple one.

Huh???

What are you saying here? AFAICT, this has no bearing on the discussion of
`qsort' which is happening on this thread.

I can't even see it as evidence that `sqrt' is slow. If you'll look at the
sources, I fail to see how it could be much faster or simpler. GCC's builtin
version is more complicated, even (but I think it checks for errors).

Nate Eldredge
nate AT cartsys DOT com