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?
Answer: Option C
Was this answer helpful ?
The space complexity of the above Wagner“Fischer algorithm is O(mn).
Was this answer helpful ?
Submit Solution