If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________ans.RecursionDivide and conquerGreedyDynamic programming Previous Marked for Review Next

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________ Dynamic programming  Greedy Divide and conquer  Recursion

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________ans.

f a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called _____________

Partition the problem into independent sub-problems•Solve the sub-problems recursively•Combine the solutions to solve the original problem, These are the steps of1 pointBrute ForceDivide and ConquerDynamic ProgrammingGreedy Approach

In divide & conquer strategy, problems are usually solved recursively.