DeepRead
Cover of Introduction to Algorithms

About the book

A comprehensive undergraduate and graduate-level survey of computer algorithms and data structures, covering sorting, searching, graph algorithms, dynamic programming, greedy methods, and related topics such as NP-completeness and approximation. It presents each algorithm in English and in a readable pseudocode, with figures showing how they work. Algorithm design should be organized around general techniques and judged by efficiency, so each algorithm's running time is analyzed carefully and its growth rate is compared against alternatives. The authors hold that mathematical rigor and engineering practicality belong together, and they keep explanations elementary without giving up depth of proof. The book treats the study of algorithms as a unified field in which the same analytical tools apply across very different problems.

Written by Claude from what it knows of this book.

What Hacker News says 38% recommend · 9% critical

050100200720102015202020262021 peak · 81
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say 4.19 from 26 ratings

  1. 513
  2. 49
  3. 32
  4. 20
  5. 12
  • 648 want to read
  • 37 reading
  • 37 have read

Open Library’s page for the book

What Wikipedia says

  • published 1990
  • 1,312 pages
  • articles in 13 languages

Read the Wikipedia article

Reddit communities — coming later

The threads it came up in

Details

First published
1990
ISBN
9780262033848
Editions known
30 at Open Library
Open Library
OL4781294W

005.154.1054.10 theoretical informaticsAlgorithmentheorieAlgorithmesAlgorithmische ProgrammierungAlgorithmsAlgorithms and Data StructuresAlgorithmusAlgoritmenCOMPUTER PROGRAMSCOMPUTERSComputer algorithmsComputer programming

Explore in the mosaic

Read next: its neighbours on the mosaic