This seems to be a homework problem! Well you could search for the pattern T' in string TT. TT = ARCARC T' = ARC search for T' in TT, if it exists then T' is a cyclic rotation
On Nov 28, 11:23 am, "Anupama Murthi" <[EMAIL PROTECTED]> wrote: > Hi all, > linear time to determine cyclic strings... give a linear time algorithm to > determine if a text T is a cyclic rotation of another string T'. For eg. ARC > and CAR are cyclic rotations of each other. > > -- > Anupama --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
