Suppose we are given the text string
T = "abacaabaccabacabaabb"
and the pattern string
P = "abacab".
In Figure 12.3, we illustrate the execution of the brute-force
pattern matching
algorithm on T and P.
Suppose we are given the text string T = "abacaabaccabacabaabb" and the pattern string P = "abacab". In Figure 12.3, we
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am