![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
Q. |
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) |
Answer» C. o(mn) | |
Explanation: the time complexity of the wagner–fischer algorithm is o(mn). |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet