Handbook of Algorithms and Data Structures






  1. Introduction

    1. Structure of the chapters
    2. Naming of variables
    3. Probabilities
    4. Asymptotic notation
    5. About the programming languages
    6. On the code for the algorithms
    7. Complexity measures and real timings

  2. Basic Concepts (Expand)

    1. Data structure description
    2. Algorithm descriptions

  3. Searching Algorithms (Expand)

    1. Sequential search
    2. Sorted array search
    3. Hashing
    4. Recursive structures search
    5. Multidimensional search

  • Sorting Algorithms (Expand)

    1. Techniques for sorting arrays
    2. Sorting other data structures
    3. Merging
    4. External sorting

  • Selection Algorithms (Expand)

    1. Priority queues
    2. Selection of kth element

  • Arithmetic Algorithms (Expand)

    1. Basic operations, multiplication/division
    2. Other arithmetic functions
    3. Matrix multiplication
    4. Polynomial evaluation

  • Text Algorithms (Expand)

    1. Text searching without preprocessing
    2. Searching preprocessed text
    3. Other text searching problems

  • Distributions Derived from Empirical Observation

    1. Zipf's law
    2. Bradford's law
    3. Lotka's law
    4. 80%-20% rule

  • Asymptotic Expansions

    1. Asymptotic expansions of sums
    2. Gamma-type expansions
    3. Exponential-type expansios
    4. Asymptotic expansions of sums and definite integrals containing e^-x^2
    5. Doubly exponential forms
    6. Roots of polynomials
    7. Sums containing descending factorials
    8. Summation formulas

  • References

    1. Textbooks
    2. Papers

  • Algorithms coded in Pascal and C

    1. Searching algorithms
    2. Sorting algorithms
    3. Selection algorithms
    4. Text algorithms


    © Addison-Wesley Publishing Co. Inc.