CHAPTER 3Lists S1 Abstract Data Type (ADT) Definition Data Type Objects Operations Example】int={0,±1,±2,…,IT_MAX,IT_MIN} +,-,×,÷,%,…} 【 Definition】 An Abstract Data Type(adt) is data type that is organized in such a way that the specification on the objects and specification of the

7.1 基本概念 7.2 三种Ｏ(n2)的简单排序 7.3 Shell排序 7.4 基于分治法的排序 7.5 堆排序 7.6 分配排序和基数排序 7.7 排序算法的理论和实验时间代价 7.8 排序问题的下限

CHAPTER 4 Stacks and Queues SI The stack adt 1. ADT 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

2.1 线性表(linear list) 2.2 顺序表—向量(Sequential list— vector ) 2.3 链表(Linked list) 2.4 线性表实现方法的比较 2.5 栈(Stack) 2.6 队列(Queue)

Definition A tree is a collection of nodes. The collection can be empty: otherwise, a tree consists of (1) a distinguished node r, called the root; (2)and zero or more nonempty(sub)trees T1,., Tk, each of whose roots are connected by a directed edge from r Note: