Question

Distinguish between divide and conquer and dynamic programming

Answer 1

Answers:

Divide and Conquer works by dividing the problem into sub-problems, conquer each sub-problem recursively and combine these solutions. Dynamic Programming is a technique for solving problems with overlapping subproblems.

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 ...