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).

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

Explanation by: Mr. Dubey

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

💬 Discussion

📊 Question Analytics

👁️

1020

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate