Sail E0 Webinar
Question
What is the space complexity of the above implementation of Wagner“Fischer algorithm where "m and "n are the lengths of the two strings?
Options:
A .  O(1)
B .  O(n+m)
C .  O(mn)
D .  O(nlogm)
Answer: Option C


The space complexity of the above Wagner“Fischer algorithm is O(mn).



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers