🚀 go-pugleaf

In article <4sgqgj$fp4@duke.telepac.pt>, phmail@mail.telepac.pt says...
>
>If someone have a sample of a sort algorithm faster than bubble please
>e-mail me. Lists above 5000 elements.
>Thanks.
>

I stumled into this group but I might be able to help.  I might be telling you 
something you know but there are two approaches.  Some sorts are data 
structure dependent and a function of the creation of the data.  Examine b 
trees and 2-3 trees.

Others are for sorting a complete set of data.  For a sorting algorithm try 
searching on shell sort, quick sort or heap sort.  Any of these will spank the 
bubble sort which has a big O time of n squared.

Matt Handy
handy@wavelength.com