Q5
Which of the following is a classic example of a problem that uses Dynamic Programming for optimization?
A.
Depth-First Search
B.
Binary Search
C.
Quick Sort
D.
Knapsack Problem
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board