Q38
What is the worst-case time complexity of the Rabin-Karp algorithm when dealing with multiple patterns?
A.
O(m + n)
B.
O(m*n)
C.
O(mnk)
AnswerD.
O(n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board