From: Sam Schetterer (samthecppman_at_[hidden])
Date: 2007-03-18 11:04:31
On March 18, Henrik Sundberg wrote
>Isn't sort within sort handled by a more complex '<' operation?
>I.e '<' returns the order of the inner sort, when the outer is equal.
Yes, that can be done, but it is much slower because of the many operations
that need to be done. In addition, since radixquicksort is to be used for
strings, the compare operation will still have to use a string comparison,
severly slowing it down. Also, if you use a function that creates a string,
you can do an extrordanarily complex sort, like sort by name, then number,
then grade, and if grade is below a B+, then sort by age. This can be done
because you cn change how the id string is created. That is why quicksort is
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk