Give an example of a text of length n and a pattern of lengthmthat constitutes a worst-case input for the brute-force string-matching algorithm. Exactly how many character comparisons will be made for such input?
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.