Data Structures and AlgorithmsThe 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. |
Contents
Design and Analysis of Algorithms | 1 |
Chapter | 11 |
Basic Data Types | 37 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
adjacency algorithm arcs array assume average begin binary block bucket called cell Chapter character child complete component compute connected consider consisting constant containing cost course data structure defined DELETE depth-first directed edges efficient element empty equal example expression field Figure function give given graph header hold implementation indicating initial input INSERT integer label least leaves length less linked loop mapping matching merge move node Note operations parent Pascal pass path pivot pointer position possible priority problem procedure queue record recursive represent representation requires result root running sequence shown in Fig shows solution solve sort space spanning stack statements steps string Suppose takes tion tree true vertex vertices Write