Naive implementation of Crochemore repetition founding algorithm.
Perfect implementation could be n log n, but this one is n^2 in worth case.
Naive implementation of Crochemore repetition founding algorithm.
Perfect implementation could be n log n, but this one is n^2 in worth case.