Hi, Say i have a string abcd bcda is a cyclic permutation of abcd obtained by rotating the string 1 left.
Given a string P of length n, how to determine if string S of length is cyclic permutation of string P. Second which way should we rotate left or right so that the cyclic permutations are same. Is there any efficient algorithm for this. Any ways of finding it by how much to rotate without actually rotating --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
