DeepRead
Cover of An introduction to the analysis of algorithms

An introduction to the analysis of algorithms

Robert Sedgewick, Philippe Flajolet · 1995

Programming and computer science › Algorithms and coding interviews

#6,137 most recommended

About the book

The book covers the mathematical analysis of algorithms and their data structures, drawing on discrete mathematics, elementary real analysis, and combinatorics. It applies these tools to sorting, tree search, string search, and hashing, along with the underlying structures of trees, strings, and maps. The central claim is that algorithm performance can be predicted precisely by translating a method's structure into recurrences or combinatorial specifications, then solving them with generating functions and asymptotic estimates. The emphasis is on average-case or probabilistic analysis, with the basic tools for worst-case or complexity analysis included as well. The book presents these techniques as a systematic method rather than a collection of ad hoc calculations.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

02420132015202020252013 peak · 1
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 5 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1995
ISBN
9780321905758
Editions known
10 at Open Library
Open Library
OL1907086W

005.131.1054.10AlgorithmsAlgorithmusAlgoritmenAlgoritmos e estruturas de dadosAnalyseComputer algorithmsProgrammanalyseProgramming - general & miscellaneousProgrammingalgorithmsQa76.9.a43 s43 1996St 130

Explore in the mosaic

Read next: its neighbours on the mosaic