1. 栈 stack的定义 栈是特殊的线性表，仅在表的一端进行插入或删除操作

一、图的基本概念 二、图的存储表示 三、图的遍历与连通性 四、最小生成树 五、最短路径 六、活动网络

(C)1.在一个图中,所有顶点的度数之和等于图的边数的倍。 A.1/2 B.1 C.2 D.4

const int maxLen = 128; class String { int curLen; //串的当前长度 char *ch; //串的存储数组 public: String ( const String& ob ); String ( const char * init );

Definition of search Static search table Dynamic search table Hash table

G( V, E ) where G ::= graph, V = V( G ) ::= finite nonempty set of vertices, and E = E( G ) ::= finite set of edges

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

A stack is a Last-In-First-Out (LIFO) list, that is, an ordered list in which insertions and deletions are made at the top only. Objects: A finite ordered list with zero or more elements

【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

第九章 一、概述 二、插入排序 三、交换排序 四、选择排序 五、归并排序 六、基数排序 七、外排序