Q8
How does Dynamic Programming differ from Greedy algorithms?
A.
Greedy algorithms solve subproblems optimally.
B.
DP is faster and uses less memory.
C.
DP considers all possible solutions and builds up to the optimal solution.
AnswerD.
Greedy algorithms always use recursion.
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board