DeepRead
Cover of Compared to what?

About the book

An introductory textbook on the analysis of algorithms, covering how to measure the time and space a method needs and how to compare one method against another. It is aimed at computer science students and works through standard problems such as sorting and searching. Its central point is that an algorithm's efficiency means something only relative to an alternative or a standard of comparison, so the question of which method is better must be posed against a clear model of cost and input size. It develops asymptotic notation and worst-case, average-case, and probabilistic analysis as tools for that comparison, and it uses lower bounds to show when a problem cannot be solved faster than a given limit.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

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

  • 2 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
1992
ISBN
9780716782438
Editions known
4 at Open Library
Open Library
OL2629289W

Computer algorithms

Explore in the mosaic

Read next: its neighbours on the mosaic