文档介绍：Data Structures and Algorithms: Table of Contents
Data Structures and Algorithms
Alfred V. Aho, Bell Laboratories, Murray Hill, New Jersey
John E. Hopcroft, Cornell University, Ithaca, New York
Jeffrey D. Ullman, Stanford University, Stanford, California
PREFACE
Chapter 1 Design and Analysis of Algorithms
Chapter 2 Basic Data Types
Chapter 3 Trees
Chapter 4 Basic Operations on Sets
Chapter 5 Advanced Set Representation Methods
Chapter 6 Directed Graphs
Chapter 7 Undirected Graphs
Chapter 8 Sorting
Chapter 9 Algorithm Analysis Techniques
Chapter 10 Algorithm Design Techniques
Chapter 11 Data Structures and Algorithms for External Storage
Chapter 12 Memory Management
Bibliography
file:///F|/Manuales/Varios/book9/ 16:16:17
Preface
Return to Table of Contents Next Chapter
Preface
This book presents the data structures and algorithms that underpin much of today'puter
programming. The basis of this book is the material contained in the first six chapters of our earlier
work, The Design and Analysis puter Algorithms. We have expanded that coverage and have
added material on algorithms for external storage and memory management. As a consequence, this
book should be suitable as a text for a first course on data structures and algorithms. The only
prerequisite we assume is familiarity with some high-level programming language such as Pascal.
We have attempted to cover data structures and algorithms in the broader context of solving problems
puters. We use abstract data types informally in the description and implementation of
algorithms. Although abstract data types are only starting to appear in widely available programming
languages, we feel they are a useful tool in designing programs, no matter what the language.
We also introduce the ideas of step counting and plexity as an integral part of the problem
solving process. This decision reflects our longheld belief that programmers are going to