Q2
What is the time complexity of the Boyer-Moore string matching algorithm in the best case?
A.
O(m + n)
B.
O(n)
C.
O(m/n)
AnswerD.
O(m log n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board