

MCQOPTIONS
Saved Bookmarks
1. |
The Knapsack problem is an example of ____________ |
A. | Greedy algorithm |
B. | 2D dynamic programming |
C. | 1D dynamic programming |
D. | Divide and conquer |
Answer» C. 1D dynamic programming | |