DeepRead
Cover of Data structures and algorithms

About the book

A textbook on the fundamental data structures and algorithms of computer science, covering lists, stacks, queues, trees, heaps, hash tables, graphs, sorting, searching, and related problems. It was co-written with John E. Hopcroft and Jeffrey D. Ullman and is aimed at students and programmers who need to understand how these methods are built and analysed. Its central claim is that the choice of data structure and the design of an algorithm cannot be separated, so each algorithm should be understood together with the structures that support it. It treats asymptotic analysis of running time and space as the standard for comparing methods, and it presents abstract data types as a way to specify what a structure does before deciding how to implement it. The book holds that careful analysis, not just working code, is what lets a programmer pick a method that will still perform well as inputs grow.

Written by Claude from what it knows of this book.

What Hacker News says 20% recommend · 0% critical

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

In the commenters’ own words

What Open Library readers say 4.43 from 7 ratings

  1. 54
  2. 42
  3. 31
  4. 20
  5. 10
  • 79 want to read
  • 8 reading
  • 6 have read

Only 7 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

Details

First published
1983
ISBN
9780201000238
Editions known
4 at Open Library
Open Library
OL3509435W

AlgorithmesAlgorithmsAlgoritmenComputer algorithmsComputing and ComputersData structures (Computer science)DatastructurenStructures de donnâees (InformatiqueStructures de données (Informatique)Structures, theory of, data processing

Explore in the mosaic

Read next: its neighbours on the mosaic