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.
2.9k
0
Do you find this helpful?
13

Discussion

No comments yet