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

复旦大学：《数据结构与算法设计》综合项目_Project2. English-Chinese dictionary based on binary search tree

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

复旦大学：《学术英语（社会科学）》知识讲座_学为人师，术业有专——记“学术英语课程设计与教学方法研修班

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

复旦大学：《学术英语（社会科学）》知识讲座_“学”无止境 “术”有教法——记“学术英语课程设计与教学方法研修班

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

11.1 String matching problem 11.2 Naive string-matching algorithm 11.3 Rabin-Karp algorithm 11.4 Finite automaton 11.5 Knuth-Morris-Pratt algorithm

9.1 Activity-selection problem 9.2 Introduction to greedy solution 9.3 Steps of the greedy strategy 9.4 Knapsack problem 9.5 Huffman code

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