MYY-405: Design and Analysis of Algorithms
Lecture Notes
- A Gentle Introduction: DAA-1.0-Introduction
- Algorithms and Complexity: DAA-2.0-Complexity
- Divide-and-Conquer: DAA-3.0-Divide-and-Conquer
- Selection Algorithms: DAA-4.0-Selection Algorithms
- Sorting Algorithms: DAA-5.0-Sorting Algorithms
- Matching Algorithms: DAA-6.0-Matching Algorithms
- Basic Graph Algorithms: DAA-7.0-Basic Graph Algorithms
- Greedy Algorithms: DAA-8.0-Greedy Algorithms
- Dynamic and Linear Programming: DAA-9.0-D&L Programming
- Reductions: DAA-10.0-Reductions
Textbooks
T. Cormen, C. Leiserson, R. Rivest, and C. Stain, Introduction to Algorithms, MIT Press (3rd edition), 2009; also in Greek.
S. Dasgupta, C. Papadimitriou, and U. Vazirani, Algorithms, McGraw-Hill, 2008; also in Greek.
J. Kleinberg and E. Tardos, Algorithm Design, Addison-Wesley, 2005; also in Greek.