<snip> So why this? " That being said, I'd put my implementation of Introsort up against any other generic sort any day of the week. The code is a C++ template class, freely available at http://www.michael-maniscalco.com/sorting.htm.
- Michael A Maniscalco " Why Michael? Why?? <snip> Short answer is that a ternary quicksort has some big advantages over the basic quicksort. (which this implementation is). The most obvious advantage being multikey quicksort. And, while there may be some good STL implementations out there, they: 1: might not be a ternary sort 2: don't lend themselves to being modified for an custom multikey quicksort purpose. That is, I don't think it's a good idea to modify STL code so that you can do multikey sorting. But this code makes it very easy to do without going in and changing the STL code. - Michael --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
