This is a required course offered for the undergraduate students at the Department of Computer Science and Information Engineering, National Taiwan University.

In this course, I will introduce fundamental techniques for the design and analysis of algorithms, with an emphasis on methods that are useful in practice. Topics include divide-and-conquer, dynamic programming, greedy algorithms, graph algorithms, approximation algorithms, and computational intractability. Advance topics may include randomized algorithms and probabilistic analysis, algorithmic game theory, and cryptography.

This course assumes that students have basic programming skills and knowledge of data structures.
For more information, please visit the course website at http://www.csie.ntu.edu.tw/~ada/