A point which I have not seen mentioned is cache performance. One of the big advantages that Quicksort and variants like Introsort gain over the closest competitors such as Radix sort is that they are far more cache friendly and this can make all the difference on modern machines.
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 --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
