1.

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)
D. O(nlogm)
Answer» D. O(nlogm)


Discussion

No Comment Found

Related MCQs