[thelist] Sorting Algorithms

[Rory.Plaire at wahchang.com]

| Bubblesort is great, but it always struck me as a bit
| inefficient. Are there any quicker ones?
| 
| Martin
| 

Hi Martin,

 From the old school days, I seem to remember the radix sort being the champ.
It has O(kN), where k is a constant. Of course, there are stipulations, like
needing extra storage and having a hard time with floating points...
However, this looks like an interesting read for even the latter problem:
(http://www.codercorner.com/RadixSortRevisited.htm).

There are always a number of flavors of quicksort -- O(Nlog2N) -- to work
with...

<rory disposition="enjoy!" alt="8)"/>