> By the way, what's the fastest sorting algorithm? Note, I said fastest, not most efficient.

The fastest sorting algorithms, always in worst and average cases taking order NlogN, are ones which do absolutely no comparisons between elements. It is the comparisons that cost time. They do exist although I do not have my algorithm book with me to look up the names. One I believe was nicknamed the "pigeonhole" sort. Most of them are severly limited in use though, having many conditions which must be known ahead of time.

Out of curiosity, what is your answer?