Q113
Which of the following methods can be used to solve the Knapsack problem?
A.
Brute force algorithm
B.
Recursion
C.
Dynamic programming
D.
Brute force, Recursion and Dynamic Programming
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board