DeepRead
Cover of Data Structures and Algorithms in Python

Data Structures and Algorithms in Python

Michael T. Goodrich, Roberto Tamassia, Michael H Goldwasser · 2012

Programming and computer science › Algorithms and coding interviews

#4,944 most recommended

About the book

A university-level textbook on the design and analysis of fundamental data structures and algorithms, implemented in Python. It covers sequences such as arrays, linked lists, stacks, and queues, along with trees, priority queues, hash tables and maps, sorting and searching, graphs, and text processing. It assumes a working knowledge of Python and introduces object-oriented design as part of its implementations. The book's central position is that a data structure should be understood through its abstract interface and its trade-offs, with its efficiency judged by asymptotic analysis rather than by measured running time alone. It holds that the choice among structures, such as a list versus a linked structure or a tree versus a hash table, follows from the operations a program needs and their cost. Each structure is presented as a set of algorithms whose correctness and growth rates can be argued before any code is tuned.

Written by Claude from what it knows of this book.

What Hacker News says 63% recommend · 13% critical

024201720182020202220242024 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.

  • 49 want to read
  • 3 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
2012
ISBN
9781118290279
Editions known
6 at Open Library
Open Library
OL19548248W

AlgorithmsComputer algorithmsData structures (Computer science)Python (Computer program language)

Explore in the mosaic

Read next: its neighbours on the mosaic