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

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

上海交通大学：《新闻实务 Journalism Practice（内容策划与媒体设计）》课程教学资料（PPT讲稿）政府对媒体的内容策划（下）

上海交通大学：《新闻实务 Journalism Practice（内容策划与媒体设计）》课程教学资料（PPT讲稿）政府对媒体的内容策划（上）

上海交通大学：《新闻实务 Journalism Practice（内容策划与媒体设计）》课程教学资料（PPT讲稿）电子媒体（广播、电视内容策划（上）

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

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

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

上海交通大学：《新闻实务 Journalism Practice（内容策划与媒体设计）》课程教学资料（PPT讲稿）传统媒体——平面媒体（报纸、杂志）内容策划（下）

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