Q. Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
✅ Correct Answer: (A)
true
Explanation: the worst case time complexity of rabin karp algorithm is o(m*n) but it has a linear average case time complexity. so rabin karp and naive pattern searching algorithm have the same worst case time complexity.