Q. |
The Knapsack problem is an example of |
A. | greedy algorithm |
B. | 2d dynamic programming |
C. | 1d dynamic programming |
D. | divide and conquer |
Answer» B. 2d dynamic programming | |
Explanation: knapsack problem is an example of 2d dynamic programming. |
Login to Continue
It will take less than 2 minutes