Q297
If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called . . . . . . . .
A.
Dynamic programming
B.
Greedy
C.
Divide and conquer
AnswerD.
Recursion
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board