Course:
Course Program:
0. Big-O notation
1. Algorithms with numbers
2. Divide-and-conquer algorithms
3. Decompositions of graphs
4. Paths in graphs
5. Greedy algorithms
6. Dynamic programming
7. Randomized algorithms
Textbook:
“Algorithms,” by Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh Vazirani. McGraw-Hill Science/Engineering/Math, 2006.