DeepRead
Cover of Algorithms and data structures

Algorithms and data structures

Niklaus Wirth · 1986

Programming and computer science › Algorithms and coding interviews

#2,465 most recommended

About the book

A textbook on the design of algorithms and the data structures they operate on, using Pascal for all of its example programs. It covers basic data types and structures such as arrays, records, sets and files, along with sorting, searching, recursion, dynamic structures like lists and trees, and related techniques. The book's central claim is that a program is algorithms plus data structures, and that the two cannot be designed separately because the chosen representation shapes the algorithm and the reverse holds too. Wirth presents stepwise refinement as the method for developing correct programs from an abstract statement of the problem down to concrete code. It also argues that clear, systematic structure in both data and procedures makes programs easier to reason about and verify.

Written by Claude from what it knows of this book.

What Hacker News says 47% recommend · 6% critical

02420082015202020262015 peak · 3
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say 1.00 from 1 rating

  1. 50
  2. 40
  3. 30
  4. 20
  5. 11
  • 30 want to read
  • 2 reading
  • 0 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
1986
ISBN
9780130220059
Editions known
4 at Open Library
Open Library
OL2589572W

005.7/3AlgorithmsAlgorithms and Data StructuresComputer algorithmsComputersData structures (Computer science)Electronic digital computers, programmingQa76.9.d35 w58 1986Алгоритмы и структуры данныхКомпьютеры

Explore in the mosaic

Read next: its neighbours on the mosaic