An introduction to the analysis of algorithms
by Robert Sedgewick and Philippe Flajolet
- 4 Want to read
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.
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
An introduction to the analysis of algorithms
2013, Addison-Wesley
Hardcover
in English
- Second edition
032190575X 9780321905758
|
aaaa
|
2
An introduction to the analysis of algorithms
1996, Addison-Wesley
in English
020140009X 9780201400090
|
eeee
|
3
An Introduction to the Analysis of Algorithms
November 30, 1995, Addison-Wesley Professional
in English
020140009X 9780201400090
|
zzzz
|
Book Details
Table of Contents
Edition Notes
Classifications
Contributors
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
History
- Created February 17, 2020
- 7 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| December 19, 2023 | Edited by ImportBot | import existing book |
| August 29, 2022 | Edited by WikidataBot | [sync_edition_olids] add wikidata identifier |
| October 10, 2020 | Edited by ImportBot | import existing book |
| August 3, 2020 | Edited by ImportBot | import existing book |
| February 17, 2020 | Created by NicolasKaiser | Added new book. |