MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
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» D. O(nlogm) | |