What is the time complexity of the Wagner–Fischer algorithm where “m” and “n” are the lengths of the two strings?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. What is the time complexity of the Wagner–Fischer algorithm where “m” and “n” are the lengths of the two strings?

(A) o(1)
(B) o(n+m)
(C) o(mn)
(D) o(nlogm)

💬 Discuss

✅ Correct Answer: (C) o(mn)

Explanation: the time complexity of the wagner–fischer algorithm is o(mn).

Explanation by: Mr. Dubey

the time complexity of the wagner–fischer algorithm is o(mn).

💬 Discussion

📊 Question Analytics

👁️

989

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

98%

Success Rate