1. Design and Analysis of Algorithms

2. Teaching Plan Part I: Foundations Part II: Sorting & Order Statistics
Growth of Function, Divide-and-Conquer
important in the analysis part
Part II: Sorting & Order Statistics
Part IV: Advanced Design and Analysis Techniques
Dynamic Programming
Greedy Algorithms

3. Teaching Plan Part VI: Graph Algorithms Part VII: Selected Topics
Minimum Spanning Tree
Shortest Path
Part VII: Selected Topics
NP-Completeness
Approximation Algorithms

4. Textbook & References Textbook: References
Introduction to Algorithms (Third Edition), by Cormen et al.
References
Introduction to Design and Analysis of Algorithms, by Lee et al.
Algorithms in C++, by Sedgewick
Foundations of Algorithms, by Neapolitan & Naimipour

5. Assessment Class Attitude: ~ 5% Assignments : ~ 30%
Home work
Programming
ShareCourse
Middle Exam : ~ 25%
Final Exam: ~ 30%
Quiz: ~ 10%
Bonus: ~ 5%

6. Websites Course: http://hscc.cs.nthu.edu.tw/~sheujp/index.html
Solutions:
ShareCourse: