An example of the worst case for bruteForceStringMatching() are strings
P = am–1b and T = an, and for BoyerMooreSimple(), strings P = bam–1 and T = an.
Explain this symmetry.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.