Gonnet G.H., Baeza-Yates R.A. Handbook of algorithms and data structures: in Pascal and C

Second edition, 1991.
Includes bibliographical references and index.
ISBN: 0-201-41607-7
1) 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
2) Basic Concepts
Data structure description
Algorithm descriptions
3) Searching Algorithms
Sequential search
Sorted array search
Hashing
Recursive structures search
Multidimensional search
4) Sorting Algorithms
Techniques for sorting arrays
Sorting other data structures
Merging
External sorting
5) Selection Algorithms
Priority queues
Selection of kth element
6) Arithmetic Algorithms
Basic operations, multiplication/division
Other arithmetic functions
Matrix multiplication
Polynomial evaluation
7) Text Algorithms
Text searching without preprocessing
Searching preprocessed text
Other text searching problems
I Distributions Derived from Empirical Observation
Zipf's law
Bradford's law
Lotka's law
80%-20% rule
II Asymptotic Expansions
Asymptotic expansions of sums
Gamma-type expansions
Exponential-type expansions
Asymptotic expansions of sums and definite integrals containing e
Doubly exponential forms
Roots of polynomials
Sums containing descending factorials
Summation formulas
III References
Textbooks
Papers
IV Algorithms coded in Pascal and C
Searching algorithms
Sorting algorithms
Selection algorithms
Text algorithms