Rajiv Mathews wrote: > @Gene > >>Use radix sort to make it O(N W) where W is the bit-width of the > >>characters in the string, hence O(N). > I don't really get how a radix pass > is going to help here either.. > Wouldn't it just order the strings, while > we really want to order the characters in > the strings?
Of course you radix sort the strings and then compare them for equality. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
