Loading practice questions
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.