Vidyalelo
Data Structure · Q10

String Matching

Programming · Data Structure · question 10

Q10

What is the average-case time complexity of the Boyer-Moore algorithm?

A.
O(m*n)
B.
O(m)
C.
O(m + n)
Answer
D.
O(n)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board