Sub-Module: Permutation (word W)
{Generate all the unique permutations of W taking all the letters of W }//End of Sub-Module. Now you can use the sub-string matching problem for the two strings. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
