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

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

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

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

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

复旦大学：《数据结构与算法设计》实验设计_Lab 4. Binary Search Trees

复旦大学：《数据结构与算法设计》实验设计_Lab 2. Divide and Conquer

复旦大学：《数据结构与算法设计》考试样卷_2009-2010年度A卷（答案）