I haven't seen anyone mention a tree sort, which is the most complex structure taught at the Community College I attended. I have no idea about its relative speed, and frankly, its been years since I've even thought about it. Indexes are much more handy.

>>I went to college 2 years ago to get a silly piece of paper so I could work in the US. After 18 years of programming, I completed a 2 year course in 6 months evenings and weekends while working.
>>
>>By the way, what's the fastest sorting algorithm? Note, I said fastest, not most efficient.
>
>Hi Mike,
>
>It'd probably be an indirect recursive Quicksort (Partition sort). By indirect I mean that you'd have an array of pointers to values that would actually be swapped rather than the actual values themselves. This is done to reduce the overhead involved in moving the actual values.