DeepRead
Cover of The algorithm design manual

The algorithm design manual

Steven S. Skiena · 1998

Programming and computer science › Algorithms and coding interviews

#91 most recommended

About the book

A practical guide to the design and analysis of algorithms for working programmers and students. It covers core data structures, general design techniques such as backtracking, dynamic programming, and heuristic search, and a catalog of classical computational problems with pointers to available implementations. Its scope is general-purpose problems rather than any one application area. Its central claim is that the hardest part of many real algorithm problems is recognizing what kind of problem you have and modeling it correctly, so a designer should first match the problem to a known problem with an existing solution before inventing something new. It argues that choosing the right data structure often matters more than fine-tuning an algorithm, and that practical work should rely on well-tested implementations and realistic test instances. Its war stories from consulting projects illustrate how the problem as first stated often differs from the problem actually needing solution.

Written by Claude from what it knows of this book.

What Hacker News says 74% recommend · 3% critical

02040200720102015202020262018 peak · 33
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say 4.38 from 8 ratings

  1. 53
  2. 45
  3. 30
  4. 20
  5. 10
  • 80 want to read
  • 3 reading
  • 11 have read

Only 8 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
1998
ISBN
9781849967204
Editions known
14 at Open Library
Open Library
OL2677499W

005.1Computer algorithmsQa76.9.a43 s55 2008

Explore in the mosaic

Read next: its neighbours on the mosaic