复旦大学：《学术英语（社会科学）》知识讲座_学术英语课程建设：路在脚下——记“学术英语课程设计与教学方法研修班

12.1 Polynomial time algorithms 12.2 Undecidable 12.3 NP-complete 12.4 Approximation algorithms 12.5 Dealing with hard problems

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

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

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

复旦大学：《数据结构与算法设计》综合项目_Project1. Combining quicksort with insertion sort

复旦大学：《数据结构与算法设计》实验设计_Lab 7. Single-Source Shortest Paths

复旦大学：《数据结构与算法设计》实验设计_Lab 5. Red-Black Tree

复旦大学：《数据结构与算法设计》实验设计_Lab 3. Hash Tables

复旦大学：《数据结构与算法设计》实验设计_Lab 1. Stack