Vidyalelo
Data Structure · Q5

String Matching

Programming · Data Structure · question 5

Q5

What is the worst-case time complexity of the Rabin-Karp algorithm?

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

Answer: Option D

Solution

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