Unit 4':
OLD Greedy Algorithms Methods
(4.5 hours)
ppt,
steps,
practice,
practice sol
These are the simplest possible algorithms. Proving they work,
however, is hard.
Unit 5':
OLD Dynamic Programming
(6 hours)
ppt,
steps,
practice,
practice sol
A harder instance is solved by filling out a table of solutions for
easier sub-instances.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.