DeepRead
Cover of Sorting and searching

Sorting and searching

Donald Knuth · 1973

Programming and computer science › Algorithms and coding interviews

#1,538 most recommended

About the book

This is the third volume of Knuth's The Art of Computer Programming, covering methods for sorting and for searching stored information. It treats internal sorting in memory, external sorting on tape and disk, and table lookup techniques including hashing, with algorithms written in the book's MIX machine language. Knuth's central claim is that algorithms should be compared by careful mathematical analysis of their running time and storage use, not by informal impressions. He develops those analyses for many methods, weighs the trade-offs between them, and examines how well-chosen data structures and hashing make searching fast. Throughout, he asks how close known methods come to theoretical lower bounds.

Written by Claude from what it knows of this book.

What Hacker News says 40% recommend · 0% critical

02.5520102015202020262013 peak · 5
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.

  • 3 want to read
  • 0 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

The threads it came up in

Details

First published
1973
ISBN
9780201038033
Editions known
2 at Open Library
Open Library
OL16998052W

AlgorithmsComputer programmingComputer programsComputersLiterary collectionsOrdinateursProgrammationSoftwareSorting (Electronic computers)

Explore in the mosaic

Read next: its neighbours on the mosaic