DeepRead
Cover of Introduction to algorithms

Introduction to algorithms

Udi Manber · 1989

Programming and computer science › Algorithms and coding interviews

#2,839 most recommended

About the book

An introductory textbook on the design and analysis of algorithms, covering the core techniques and the data structures and standard problem areas they are applied to. It is aimed at students who are learning to construct algorithms, not just to use library routines. Its central claim is that algorithms can be designed systematically by reasoning inductively: a problem is solved by assuming smaller instances are solved and extending that solution. The book presents recursion and induction as closely linked ways of structuring this reasoning. It also argues that strengthening an induction hypothesis is often what turns a correct but slow approach into an efficient one, and that students should derive algorithms from principles rather than memorize them.

Written by Claude from what it knows of this book.

What Hacker News says 93% recommend · 0% critical

02420122015202020252023 peak · 3
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.

  • 16 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
1989
ISBN
9780201120370
Editions known
4 at Open Library
Open Library
OL5092129W

AlgorithmsComputer algorithmsData structures (Computer science)Data structures (computer science)algorithm designinductionreasoningrecursion

Explore in the mosaic

Read next: its neighbours on the mosaic