一、 基本概念 二、插入排序 三、 快速排序 四、选择排序 五、归并排序 六、基数排序

Main topics Definition of graphs and some terminology Three common graph representations Some algorithms

9.1 Introduction A priority queue is a collection of zero or more elements. Each element has a priority or value

一、过程化基础 二、项目开发过程 类 三、构造函数和析构函数 四、继承与派生 五、多态性

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

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++

第七章图 选择题 1.图中有关路径的定义是()。【

第9章集合 选择题