Program has for input 1 or more periods of both sequences. How to test whether these sequences are the same with the least number of comparisons.
What's the best way to do it?
Asked
Active
Viewed 83 times
1
-
Please, provide a concrete example. – ROMANIA_engineer Oct 26 '14 at 16:46
-
Well idk this description of the problem is everything I got. – Serillan Oct 26 '14 at 16:53
-
"Program has for input 1 or more periods of both sequences." Can't parse. – n. m. could be an AI Oct 26 '14 at 16:56
1 Answers
2
Find the smallest period of the two input strings, see for example this question and this question which describe a solution using the Knuth-Morris-Pratt algorithm. Once you've found the strings' smallest periods then it's trivial to compare them.
Community
- 1
- 1
Zim-Zam O'Pootertoot
- 17,888
- 4
- 41
- 69