This quarter – summary
Stable marriage (induction)
Dynamic programming
Elementary graph algorithms
Maximum flow
Linear programming
NP-completeness
Coping with NP-completeness
Hashing
Splay Trees
Crypto (not on final)
Previous slide
Next slide
Back to first slide
View graphic version