北京大学：《数据结构与算法》课程教学资源（教学设计）二叉树（王腾蛟）

北京大学：《数据结构与算法》课程教学资源（教学设计）字符串（赵海燕）

北京大学：《数据结构与算法》实习实验教程（PPT课件讲稿）实践之四：浅谈软件测试

8.1 Manufacturing problem 8.2 Matrix-chain multiplication 8.3 Elements of dynamic programming 8.4 Four steps of development 8.5 Longest common subsequence problem

7.1 Introduction to amortized analysis 7.2 Aggregate method 7.3 Accounting method 7.4 Potential method 7.5 Dynamic tables

5.1 Dictionary problem 5.2 Hash functions 5.3 Collisions resolution by chaining 5.4 Open addressing 5.5 Probing strategies: linear, quadratic, and double hashing 5.6 Analysis of open addressing

3.1 Definition of data structure 3.2 Stacks 3.3 Queues 3.4 Linked lists 3.5 Trees 3.6 Postfix expression 3.7 Infix to postfix conversion

2.1 Divide-and-conquer design paradigm 2.2 Recurrence for merge sort and binary search 2.3 Powering a number 2.4 Fibonacci numbers 2.5 Recursive squaring 2.6 Matrix multiplication 2.7 Strassen's algorithm

1.1 Definition of algorithm 1.2 Insertion sort and merge sort 1.3 Running time and asymptotic analysis 1.4 Θ-notation, Ω-notation, and O-notation 1.5 Recurrences 1.6 Substitution, recursion-tree method, and master method

复旦大学：《数据结构与算法设计》综合项目_Project3. All-pairs shortest path