DeepRead
Cover of Data structures and algorithm analysis

Data structures and algorithm analysis

Mark Allen Weiss · 1992

Programming and computer science › Algorithms and coding interviews

#6,444 most recommended

About the book

The book covers the design and analysis of common data structures and algorithms, including lists, stacks, queues, trees, hashing, priority queues, sorting, disjoint sets, and graph algorithms. It is aimed at undergraduate computer science courses and pairs each structure with implementation code and its running-time analysis. Choosing a data structure or algorithm should rest on a mathematical estimate of its running time and memory use, expressed with asymptotic notation, rather than on intuition or small-input testing. The text holds that the same problem can have solutions differing by orders of magnitude, and that analysis can show which one scales. It also claims that many of the standard structures, such as balanced trees, heaps, and hash tables, exist to keep common operations within provable bounds, and it treats amortized analysis and NP-completeness as tools for judging what is achievable.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

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

  • 6 want to read
  • 4 reading
  • 1 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

Details

First published
1992
ISBN
9780805390520
Editions known
4 at Open Library
Open Library
OL1958935W

AlgorithmentheorieAlgorithmusComputer algorithmsData structures (Computer science)DatenstrukturProgrammanalyse

Explore in the mosaic

Read next: its neighbours on the mosaic