Data Structures and Algorithms
The authors' treatment of data structures in Data Structures and Algorithms is unified by an informal notion of "abstract data types," allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.
Design and Analysis of Algorithms
Basic Data Types
10 other sections not shown
Other editions - View all
0(nlogn abstract data type adjacency list arcs array assume augmenting path available list average B-tree begin binary search tree binary tree bucket buddy bytes called cell celltype Chapter color compute consider constant cost cursor cycle data structure defined DELETE DELETEMIN depth-first search dictionary digraph directed graph edges element elementtype empty blocks end end example field function hash table header heapsort implementation initial input INSERT integer key value label leaf linked list loop main memory MAKENULL merge mergesort operations ordered tree parent partially ordered tree Pascal pivot pointer position preorder priority queue problem procedure quicksort recursive represent representation root runs of length Section sequence shortest path shown in Fig solution solve sorted order sorting algorithm space spanning tree stack steps string subproblems subtree Suppose swap tion tour variable vertex vertices Write a program