Intro
Lec1 ：Perfect Matching
Lec2 : Algorithm Analysis
lect3: Graphs
lec4: Greedy Algorithms
lect5: Divide and Conquer I
lect6: Master Theorem
lect7: Dynamic Programming 动态规划
lect8：Edit Distance
lect10: NP Problem I
lect11: NP Problem II
lect12: Approximation Algorithms
lect13: Randomized Algorithms
hw1
hw2 ch3,4
hw3
hw4 ch 6 Dynamic Programming
hw5: ch8 NP and Computational
Intractability
hw6：Approximation Algorithms