- Lecture Notes.
Greedy Algorithms: the basic idea.
- Puzzle: the coin changing problem. Here's a version of it, the
Martian coin changing problem from a programming contest.
Investigating the theoretical
Lena Chang and James F. Korsh. Canonical coin changing and greedy
solutions. Journal of the ACM, 23(3):418-422, July 1976.
- The Greedy Approach to the
Coin Changing Problem doesn't always give the optimal
Example: 16c due, coins of 12, 10, 5, 1. Greedy: 12, 1, 1, 1,
1. Optimal: 10, 5, 1. ("delayed gratification")
Greedy Algorithm in Motion, from an
article in the
American Scientist about
Reapportionment and redistricting (meta-politics).
Vasek Chvatal's notes on MST and links to Java applets.
Minimum Spanning Tree Problem, via an example: offshore
oilfield pipeline network.
Prim's Algorithm and Java applet.
Kruskal's Algorithm and Java applet.