Class Notes

Class notes will be placed here as they are created. These notes are for my use, but are provided for your convenience. In addition, programs created in class will be posted as they are created.

Introduction
- Algorithms and Course Expectations.
- Why study algorithms?
- What algorithms will we study?
Growth of Functions and Notations
Recurrences
Sorting in Linear Time
Medians and Order Statistics
Greedy Algorithms
Graph Algorithms
Minimal Spanning Trees
Single Source Shortest Path
All-Pairs Shortest Path
Maximum Flow
Distributed Algorithms