DeepRead
Cover of Algorithms

About the book

A survey of fundamental algorithms and data structures for sorting, searching, graphs, strings, and geometric problems, with each method presented as a Java implementation. It covers how the methods work and how their running time and memory use can be analyzed and measured in practice. The book holds that algorithms are best understood through working code, empirical testing, and mathematical analysis together, so performance should be measured and modeled rather than assumed. It argues that a relatively small core of data structures and algorithms, such as balanced search trees, hash tables, priority queues, and graph search, covers a wide range of practical problems. It also presents the scientific method of observing, hypothesizing, measuring, and validating as a working approach to studying running time.

Written by Claude from what it knows of this book.

What Hacker News says 61% recommend · 1% critical

01020200720102015202020262012 peak · 11
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say 4.00 from 5 ratings

  1. 52
  2. 42
  3. 30
  4. 21
  5. 10
  • 38 want to read
  • 1 reading
  • 5 have read

Only 5 ratings: treat the average as a hint.

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
2011
ISBN
9780321573513
Editions known
2 at Open Library
Open Library
OL16116506W

AlgorithmsComputer algorithmsComputer programmingTextbooks

Explore in the mosaic

Read next: its neighbours on the mosaic