Question

Divide and conquer and dynamic programming difference between

Answer 1

The difference between the two lies in the nature of subproblems. In divide and conquer paradigm, all subproblems are independent in nature and they do not overlap when you keep dividing problems into subproblems, each subproblem isrequired to be solved only once.

Answer 2

Answer:

One major difference between greedy algorithms anddynamic programming is that instead of first finding optimal solutions to subproblems and then making an informed choice, greedy algorithms first make a greedy choice, the choice that looks best at the time, and then solve a resulting subproblem, without bothering to ...