If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called __________
Posted: Wed Jul 13, 2022 7:40 pm
a) Dynamic programming
b) Greedy
c) Divide and conquer
d) Recursion
b) Greedy
c) Divide and conquer
d) Recursion