Two kinds of data structure Linear: list, stack, queue, string Non-linear: tree, graph

3.1 栈 3.2 栈的应用举例 3.3 栈与递归的实现 3.4 队列

2.1 线性表的类型定义 2.2 线性表的顺序表示和实现 2.3 线性表的链式表示和实现 2.4 一元多项式的表示及相加

4.1 1D-Array 1. One-dimensional array 1D-array is a limited sequence composed of n (n20) elements which are of the same data type. For example:

2.1 Preface Performance of a program: the amount of computer memory and time needed to run a program We use two approaches to determine it: performance analysis performance measurement

The purpose and contents of the course Introduce most used data structures and algorithms Prerequisite of other courses Introduce algorithm analysis Review C++

一、设计理论 二、分析方法 三、实现技术 四、测试技术

一、计算模型与计算复杂度关系 二、问题分类:【P】与【NP】类

Comparison of the heaps Mergeable heaps support the following 7 If not support the operation union than the operations binary heap is better than binomial heap 1. Create heap 2. Insert

一、多项式的表示方式 二、多项式的基本运算