Q53
What is the worst case running time in searching phase of Boyer-Moore's algorithm?
A.
O(n)
B.
O(log n)
C.
O(m+n)
D.
O(mn)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board