Textbook Data structure, algorithms, and applications in C++, Sartaj Sahmi 数据结构(用面向对象方法与C++描述),殷人昆等

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:

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

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

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

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

【Definition】An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. In addition, all algorithms must satisfy the following criteria: (1) Input There are zero or more quantities that are externally supplied

1 Preliminaries 1. Terminology Lineal Tree Pedigree Tree ( binary tree )

西安建筑科技大学：《数据结构基础》课程课堂笔记_第三部分 线性表_线性表 LISTS（英文）