Handbook of Algorithms and Data Structures

Gaston H. Gonnet
Informatik, ETH Zürich

Ricardo Baeza-Yates
Dept. of Computer Science, Univ. of Chile

This 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.

Contents (Expand)

  1. Introduction
  2. Basic Concepts
  3. Searching Algorithms
  4. Sorting Algorithms
  5. Selection Algorithms
  6. Arithmetic Algorithms
  7. Text Algorithms
  8. Distributions Derived from Empirical Observation
  9. Asymptotic Expansions
  10. References
  11. Algorithms coded in Pascal and C

©Addison-Wesley Publishing Co. Inc.

Credits. For technical questions about the algorithms and data structures in the book, please contact Ricardo Baeza-Yates. We like to hear your comments! If you find any problem in accessing pages or downloding files, please contact the Webmaster.