What is the time complexity of the Wagner-Fischer algorithm where "m" and "n" are the lengths of the two strings?
O(1)
O(n+m)
O(mn)
O(nlogm)
Correct Answer: C — O(mn)
Explanation:
The time complexity of the Wagner-Fischer algorithm is O(mn).
