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)
The question was asked in quiz.
My doubt stems from Wagner-Fischer Algorithm in chapter Dynamic Programming of Data Structures & Algorithms II