Q. What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?

(A) o(n)
(B) o(n*m)
(C) o(m)
(D) o(log n)

💬 Discuss

✅ Correct Answer: (C) o(m)

Explanation: kmp algorithm is an efficient pattern searching algorithm. it has a time complexity of o(m) where m is the length of text.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

kmp algorithm is an efficient pattern searching algorithm. it has a time complexity of o(m) where m is the length of text.

💬 Discussion

📊 Question Analytics

👁️

941

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

92%

Success Rate