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