Algorithm Design and Analysis (Spring 2022)

Below are the handouts (in Chinese) written by me for the recitation lectures. Most contents are tutorials and examples for problem-solving.

Please let me know if you spot any errors. (And feel free to share the materials with the students taking the course in the future! :P)

• Introduction
• Divide and Conquer
• Dynamic Programming
• Greedy Algorithms
• Amortized Analysis
• Linear Programming
• Network Flow
• NP and Computational Intractability
• Approximation Algorithms
• Randomized Algorithms (brief intro)