# Handbook of Algorithms and Data Structures

# Contents

- Introduction
- Structure of the chapters
- Naming of variables
- Probabilities
- Asymptotic notation
- About the programming languages
- On the code for the algorithms
- Complexity measures and real timings

- Basic Concepts (Expanded)
###

- Data structure description
- Algorithm descriptions

- Searching Algorithms (Expanded)
###

- Sequential search
- Sorted array search
- Hashing
- Recursive structures search
- Multidimensional search

- Sorting Algorithms (Expanded)
###

- Techniques for sorting arrays
- Sorting other data structures
- Merging
- External sorting

- Selection Algorithms (Expanded)
###

- Priority queues
- Selection of k
*th* element

- Arithmetic Algorithms (Expanded)
###

- Basic operations, multiplication/division
- Other arithmetic functions
- Matrix multiplication
- Polynomial evaluation

- Text Algorithms (Expanded)
###

- Text searching without preprocessing
- Searching preprocessed text
- Other text searching problems

- Distributions Derived from Empirical Observation
###

- Zipf's law
- Bradford's law
- Lotka's law
- 80%-20% rule

- Asymptotic Expansions
###

- Asymptotic expansions of sums
- Gamma-type expansions
- Exponential-type expansios
- Asymptotic expansions of sums and definite integrals containing e^-x^2
- Doubly exponential forms
- Roots of polynomials
- Sums containing descending factorials
- Summation formulas

- References
###

- Textbooks
- Papers

- Algorithms coded in Pascal and C
###

- Searching algorithms
- Sorting algorithms
- Selection algorithms
- Text algorithms

##

(c) Addison-Wesley Publishing Co. Inc.

####
Edited by Omar Alonso
at the Computer Science Department,
University of Chile, Chile.
For technical questions about the algorithms and data structurs 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.