Kizspy Question: 34
(Choose 1 answer)
The brute-force pattern matching algorithm compares the pattern P containing n characters with the text T
containing m characters. What is the time complexity of it?
A. O(n*m)
B. O(n+m)
PUEVERILOV.COM
C. O(n)
D. O(m)
