An introduction to the analysis of algorithms - Info and Reading Options

The Open Library:

This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatories, as well as from classical computer science material, including algorithms and data structures. They focus on "average-case" or "probabilistic" analysis, although they also cover the basic mathematical tools required for "worst-case" or "complexity" analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms.

Search for “An introduction to the analysis of algorithms” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “An introduction to the analysis of algorithms” in Libraries Near You:

Read or borrow “An introduction to the analysis of algorithms” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “An introduction to the analysis of algorithms” at a library near you.