

McqMate
Q. |
Which of the following methods can be used to solve the edit distance problem? |
A. | recursion |
B. | dynamic programming |
C. | both dynamic programming and recursion |
D. | greedy algorithm |
Answer» C. both dynamic programming and recursion | |
Explanation: both dynamic programming and recursion can be used to solve the edit distance problem. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet