Handbook of Algorithms and Data Structures
These WWW pages are not a digital version of the book, nor the complete
contents of it. Here you will find the preface, table of contents, index
and all source code of the handbook. The main goal is to make available
through Internet the source code of many algorithms (in C and/or Pascal)
that have been already tested.
The printed version of the Handbook includes over a thousand references
and details many of the algorithms presented here. It should be ordered
directly to Addison-Wesley or a specialized bookstore.
- Basic Concepts
- Searching Algorithms
- Sorting Algorithms
- Selection Algorithms
- Arithmetic Algorithms
- Text Algorithms
- Distributions Derived from Empirical Observation
- Asymptotic Expansions
- Algorithms coded in Pascal and C
©Addison-Wesley Publishing Co. Inc.
These WWW pages were designed by Ricardo Baeza-Yates.
For suggestions, comments, and questions about the structure and design of the
pages, please send an e-mail to Omar.
For technical questions about the algorithms and data structures in the
book, please send an e-mail to Ricardo.
If you find any problem in accessing pages or downloading
files, please contact the