Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.

(A) true
(B) false
(C) ---
(D) ---
Correct answer : Option (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.

Share

Discusssion

Login to discuss.