🚀 go-pugleaf

   John Slagel (Me!) 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).
>>>
>>>   In other words, if you're sorting n objects, QuickSort takes "on the Order
>>>   of" n*log n steps, while bubble sort takes "on the order of" n*n steps.
>>>

   Dave Roberts chokes at my stupidy:
 
>Ack!!! People, remember that bubble sort has a *worst* case time of
>n!.  It can be quite fast if most things are sorted.

>Dave Roberts
>Advanced Micro Devices, Inc.
>Network Products Division
>david.roberts@amd.com

   Ack!!! Me, John Slagel, who is a soon-to-be-interviewing senior
   in C.S., gives up all hopes of getting a job with AMD :-)

-- 
------------------------------------------------------------------------
  John A. Slagel, email: jas37876@uxa.cso.uiuc.edu