DeepRead
Cover of Open Data Structures

Open Data Structures

Pat Morin · 2013

Programming and computer science › Algorithms and coding interviews

#3,547 most recommended

About the book

Open Data Structures is an introductory text on the design and analysis of the core data structures used in software, including arrays, linked lists, stacks and queues, hash tables, binary search trees, heaps, skiplists, and graph representations, along with the sorting algorithms that go with them. It is written for undergraduates and self-learners and is distributed free under an open license. The text holds that a small set of structures and techniques covers most practical needs, and that each structure should be understood through both its running-time guarantees and a working implementation. It presents simple structures alongside their trade-offs, and shows how randomization and amortized analysis can give simple code good expected or amortized bounds. The aim is for readers to be able to reason about why a structure performs as it does, not only to memorize its operations.

Written by Claude from what it knows of this book.

What Hacker News says 92% recommend · 0% critical

02420122015202020242012 peak · 2
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.

  • 1 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
2013
ISBN
9781299794641
Editions known
6 at Open Library
Open Library
OL21245462W

Computer algorithmsData structures (computer science)

Explore in the mosaic

Read next: its neighbours on the mosaic