[boost] [sorting] New example of why radixsort can be better than quicksort

From: Sam Schetterer (samthecppman_at_[hidden])
Date: 2007-03-18 14:25:25

I have uploaded the source code for this example to vault. It shows a more
extreme case of how making a more complex operator<, like Henrik
Sundberg advised, is both slow and big, while the operator[] for the samew
class is fast and small.