Which of the following methods can be used to solve the edit distance problem?
|C.||both dynamic programming and recursion|
|Answer» C. both dynamic programming and recursion|
|Explanation: both dynamic programming and recursion can be used to solve the edit distance problem.|
Login to Continue
It will take less than 2 minutes