6 Dynamic Programming

Question 1

What is dynamic programming?

Answer 1

A programming technique that breaks down the problem into sub-problems and finds the best solution for a subproblem. It then uses that previous solution to build a new optimum to a bigger sub-problem.

Question 2

What programming technique is preferable, greedy or dynamic?

Answer 2

Greedy, as it uses a rule to find the optimum at each step and usually only makes one decision per input item.

Question 3

When should you use dynamic programming?

Answer 3

When you cannot find a greedy solution that is correct for all cases.

Question 4

Why is dynamic programming close to brute force?

Answer 4

It explores all possibilities without examining each combination explicitly.