🚀 go-pugleaf

In article <1992Nov10.185527.3584@amd.com> roberts@angelo.amd.com (Dave Roberts) writes:
>In article <1992Nov8.012628.23338@menudo.uh.edu> libh@Jane.UH.EDU writes:
>>In article <BxD5pt.DyI@news.cso.uiuc.edu>, jas37876@uxa.cso.uiuc.edu (John A. Slagel) writes:
>>>   Definately the quick sort.  Its even built into ANSI C specs, so it
>>>   should be easy to implement.  Look up quicksort in your C manual. If
>>>   I remember right, bubble sort works in O(n*n) and quicksort works in
>>>   O(n*log n).

Caveat Emptor:

I gather that, although quicksort() must be available, it is not required
that it be implemented as the algorithm known as quick sort. Indeed, some
C libraries apparently implement it with bubble sort.

-T


-- 
Tom Boutell, boutell@cshl.org

Clausthaler is the best non - alcoholic beer in the known universe.