Anupama Murthi 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
could i add in my 2 cents?if i am being stup
On Nov 29, 12: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
Hi Anupama
On Nov 28, 4:23 pm, "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.
Superfic
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... g
