Q181
What is the space complexity of the above implementation of Wagner-Fischer algorithm where "m" and "n" are the lengths of the two strings?
A.
O(1)
B.
O(n+m)
C.
O(mn)
AnswerD.
O(nlogm)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board