Q55
What is the worst case running time of Rabin Karp Algorithm?
A.
Theta(n)
B.
Theta(n-m)
C.
Theta((n-m+1)m)
AnswerD.
Theta(nlogm)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board