⭐文章目录⭐
👇
声明
授课老师是毛宇尘,笔记来源为上课记录、课件、作业题和历年卷。汇总目录按照上课顺序，与课程组ppt会有些许不同.目前由于时间问题只更新了英文版本，中文版本将在寒假完善。
笔记目录
1.AVL Tree and Red-Black Tree
2.Amortized Analysis, Dynamic Array and Splay Tree
3.B+ Tree, Leftist Heap and Skew Heap
4.Binomial Tree and Binomial Heap
5.Inverted File Index.
6.Backtracking and Pruning.
7.Greedy
8.Divide and Conquer & Time Compute
9.Dynamic Programming
10.Incomputable Problems and Complexity Classes
11.Approximation Algorithms
12.Local Search
13.Randomized Algorithms
14.Parallel Algorithms
15.Externel Sorting