Path: csiph.com!eternal-september.org!feeder.eternal-september.org!reader01.eternal-september.org!.POSTED!not-for-mail
From: Tim Rentsch <tr.17687@z991.linuxsc.com>
Newsgroups: comp.lang.c
Subject: Re: Sort char array
Date: Wed, 09 Oct 2019 02:22:24 -0700
Organization: A noiseless patient Spider
Lines: 10
Message-ID: <86lftu8e9b.fsf@linuxsc.com>
References: <STKlF.8551$oU2.5908@fx21.iad> <6264b10d-109a-498d-86d5-791426100d0c@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Injection-Info: reader02.eternal-september.org; posting-host="c0077320ebba5bb8d2e49a5d4c287ef2"; logging-data="842"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+/4PzjfzyzEkbJM8tGh1BWoja41W2zpkM="
User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux)
Cancel-Lock: sha1:lfoAW6laLBWBw+lAxT04wD1t6Ao= sha1:GTqF5gZgRrZyZVKbRKm8yDa3sY8=
Xref: csiph.com comp.lang.c:146792

John Bode <jfbode1029@gmail.com> writes:

>> [...]
>
> You could use the standard qsort library function ( O(n lg n)
> average case)

That could be true but doesn't have to be.  There are no
performance requirements for the qsort() function.  (Nor
AFAIK for any other library function in ISO C.)