An introduction to the analysis of algorithms
by Robert Sedgewick, Philippe Flajolet · first published 1995
50% recommend50% neutral
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 a
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
Mentions per year
What Hacker News says
Related books
2016–2021Advanced data structures
Peter Brass
Recommended by 3 · mentioned by 33 recommend · 3 mention3 recommend · 33 recommend
2007–2026Purely functional data structures
Chris Okasaki
Recommended by 87 · mentioned by 15587 recommend · 155 mention87 recommend · 15587 recommend
2007–2026The art of computer programming
Donald Knuth
Recommended by 336 · mentioned by 1,125336 recommend · 1,125 mention336 recommend · 1,125336 recommend
2007–2026Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Recommended by 274 · mentioned by 712274 recommend · 712 mention274 recommend · 712274 recommend
Perhaps Knuth's "The Art of Computer Programming" and Sedgewick's (Knuth's student) "An Introduction to the Analysis of Algorithms". Also, Ben-Ari's "Mathematical Logic for Computer Science" and Pierce's "Software Foundations".
on “Collected Papers of Alexander A. Stepanov” ↗…a machine as a function of the input size (which was the original motivation for Knuth etc to develop the field). The same authors (but ordered as Sedgewick and Flajolet!) also have a book called An Introduction to the Analysis of Algorithms; there's a course website at https://aofa.cs.princeton.edu/home/ and videos on Coursera (https://www.coursera.org/learn/analysis-of-algorithms) — it is advanced mathematics but less advanced than the…
on “Analytic Combinatorics – A Worked Example” ↗…Sedgewick's book/course, Algorithms [1]. For more depth and theory try [2], Cormen and Leiserson's excellent Introduction to Algorithms. Alternatively the theory is also covered by another book by Sedgewick, An Introduction to the Analysis of Algorithms [3]. A classic reference that goes far beyond these other books is of course Knuth [4], suitable for serious students of Computer Science less so as a book of recipes. After these basics, there are books…
on “Ask HN: Any recommendations on resources for learning one algorithm a day?” ↗…can be had for cheap online); 1) Data Structures and Program Design in C by Kruse, Leung and Tondo. 2) Algorithms in C (Parts1-4 and Part5 two-volume set) by Robert Sedgewick. 3) Compared to What? An Introduction to the Analysis of Algorithms by Gregory Rawlins. 4) How to think about Algorithms by Jeff Edmonds. 5) Advanced Data Structures by Peter Brass. Finally, study the ideas, concepts and techniques behind the C++ STL library to see…
on “Ask HN: How to get better at Data structures and Algorithm?” ↗…that there is trie (which is also called prefix tree) and suffix tree. There is no suffix trie. At the risk of being snotty: someone should tell Robert Sedgwick. He uses the term in his newest book, "An Introduction to the Analysis of Algorithms, Second Edition," which just came out. Sorry if I haven't been fair to your post due to a quick reading but Kevin isn't making the term up.
on “The Sorry State of Trie Implementations in Python” ↗a book like "Code complete" or "An Introduction to the Analysis of Algorithms"
on “Ask HN: How do you read books, especially technical book?” ↗