Chapter 6

In general, most problems do not have a natural greedy algorithm solution that works

Divide and conquer is often not strong enough to reduce exponential brute-force search down to polynomial time

Dynamic Programming: one implicitly explores the space of all possible solutions, by decomposing things into a series of subproblems, and then building up correct solutions to larger and larger subproblems

k