A

Admin • 831.35K Points
Coach

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

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
Explanation by: Admin
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.