DeepRead
Cover of Data structure techniques

Data structure techniques

Thomas A. Standish · 1980

Programming and computer science › Algorithms and coding interviews

#11,981 most recommended

About the book

A textbook on data structures in computer science, covering how information is organized in memory and the operations (insertion, deletion, search, traversal) that can be performed on it. It is aimed at students and programmers who want to understand how the choice of representation affects the cost of those operations. The book's core position is that a program's efficiency depends largely on how its data is represented, so a programmer should choose a structure by weighing the time and storage costs of the operations the program needs. It presents techniques such as linked representations, trees, hashing, and sorting and searching methods as tools for making those trade-offs, and it supports them with algorithms and analysis rather than with a single overarching claim.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

02420192020202120222019 peak · 1
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.

  • 4 want to read
  • 1 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
1980
ISBN
9780201072563
Editions known
4 at Open Library
Open Library
OL2681106W

Data structures (Computer science)

Explore in the mosaic

Read next: its neighbours on the mosaic