Counting sort, doesn't actually *sort* the elements, at all. That's why it's so fast.
I don't know anything about using a constant amount of extra memory, which is independent of the size of the input, with counting sort. When the input range exceeds the size of the counting array, won't you be SOL? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
