Which of the following methods can be used to solve the Knapsack problem?
Brute force algorithm
Recursion
Dynamic programming
Brute force, Recursion, and Dynamic Programming
Answer is: Option D) Brute force, Recursion and Dynamic Programming
64.3k questions
77.9k answers
244k comments
80.0k users