Lecture 28: Miscellaneous items.
December 6th, 2007Last lecture ! Here are some of the things we covered today:
- I talked about computational geometry and output sensitivity. In particular, I mentioned convex hull algorithms, and how to make them optimally output sensitive.
- Next, we looked at LP-duality, and how the max-flow min cut theorem can be viewed as a special case of general LP-duality
- Online algorithms are fun to think about, especially the rent-buy ski problem, and the parking lot problem.
- Finally, we looked at amortized analysis, and why it’s good to double every time you reallocate a growing array.
Entries