ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
Correct Answer: A — True
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.