A
Q. Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.
- Correct Answer - Option(A)
- Views: 17
- Filed under category Design and Analysis of Algorithms
- Hashtags:
Discusssion
Login to discuss.