❖ 线性表 ❖ 顺序表 ❖ 链表 ❖ 顺序表与链表的比较

浙江大学：《数据结构与算法》教学(讲课)周历

一、线性结构的特点是 存在唯一的”第一个”数据元素; 存在唯一的”最后一个”数据元素;

浙江大学：《数据结构与算法》课程简介

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

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