Which of the following methods can be used to solve the Knapsack problem?
(a) Brute force algorithm
(c) Dynamic programming
(d) Brute force, Recursion and Dynamic Programming
This question was posed to me during an online interview.
I need to ask this question from 0/1 Knapsack Problem in portion Dynamic Programming of Data Structures & Algorithms II