This requires lexicographic permutations. http://en.wikipedia.org/wiki/Permutation#Lexicographical_order_generation This should be a good starting point - http://geeksforgeeks.org/?p=767.
On Sun, Aug 30, 2009 at 12:32 AM, Nagendra Kumar <[email protected]>wrote: > > Write a method to print all valid anagrams of a string > > -Nagendra > > > > -- Yesterday is History. Tomorrow is a Mystery. Today is a Gift! That is why it is called the Present :). http://sites.google.com/site/ramaswamyr --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
