DeepRead
Cover of Introduction to the design & analysis of algorithms

Introduction to the design & analysis of algorithms

Anany Levitin · 2003

Programming and computer science › Algorithms and coding interviews

#4,101 most recommended

About the book

A textbook on the design and analysis of algorithms, covering how to specify algorithms, measure their time and space efficiency, and prove their correctness. It spans sorting, searching, graph problems, string matching, and the limits of efficient computation, including NP-completeness. Its central claim is that most algorithms are instances of a small number of general problem-solving strategies, including brute force, divide-and-conquer, decrease-and-conquer, transform-and-conquer, dynamic programming, the greedy technique, and iterative improvement, so the book is organized by these strategies rather than by application domain. It presents an analysis framework based on counting basic operations and classifying growth rates with asymptotic notation, and it encourages readers to learn to match a new problem to a technique rather than memorize individual solutions. Later chapters on the limitations of algorithmic power and on coping with intractable problems show where these strategies stop working.

Written by Claude from what it knows of this book.

What Hacker News says 70% recommend · 0% critical

024200720102015202020242010 peak · 2
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say 5.00 from 1 rating

  1. 51
  2. 40
  3. 30
  4. 20
  5. 10
  • 17 want to read
  • 2 reading
  • 3 have read

Only 1 rating: 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
2003
ISBN
9780321358288
Editions known
6 at Open Library
Open Library
OL5840892W

AlgorithmsComputer algorithms

Explore in the mosaic

Read next: its neighbours on the mosaic