[boost] [sorting] How radixsort is useful

Many people are asking me how radixsort is useful. Well, I have just posted a program that does what is called a "sort within sort". It sorts a class containing an int array. The classes are first sorted by the first int in the array, and then the second. They are then outputed to the standard output in proper order. I also wrote an operator< to show how much slower that function is than operator[] for a "sort within sort". Also, if you have other ideas or questions about radix sort and radix quicksort, post them and I will write a sample program showing how radixsort and radix quicksort are useful for that purpose.