DeepRead
Cover of Selected papers on analysis of algorithms

Selected papers on analysis of algorithms

Donald Knuth · 2000

Programming and computer science › Algorithms and coding interviews

#15,077 most recommended

About the book

A collection of Donald Knuth's papers on the analysis of algorithms, the work of estimating how much time and space particular methods require. It covers the mathematical techniques used for this, mainly on sorting, searching, hashing, and combinatorial and random-number procedures. Knuth argues that analysis of algorithms is a mathematical discipline that can and should be done precisely, not just summarized as growth rates. The papers show how exact counts, asymptotic expansions, and average-case results for specific algorithms can guide practical choices between methods. They also make the case that such analyses are worth the effort because they explain observed performance and expose which implementation details matter.

Written by Claude from what it knows of this book.

What Hacker News says 0% recommend · 0% critical

024201020122014201620192010 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.

  • 3 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

Details

First published
2000
ISBN
9781575862118
Editions known
4 at Open Library
Open Library
OL1915635W

Algorithms

Explore in the mosaic

Read next: its neighbours on the mosaic