DeepRead
Cover of Grokking Algorithms

Grokking Algorithms

Aditya Y. Bhargava · 2016

Programming and computer science › Algorithms and coding interviews

#675 most recommended

About the book

Grokking Algorithms is an introduction to common algorithms and the reasoning behind them. It covers sorting and searching, recursion, quicksort, hash tables, breadth-first search, Dijkstra's algorithm, greedy methods, dynamic programming, and k-nearest neighbors, with Python code samples. Its scope is beginner-level and aimed at programmers who want to apply these techniques to everyday problems. The central claim is that algorithms can be understood through pictures and worked examples without heavy mathematics. It argues that how running time grows, expressed in Big O notation, matters more than exact operation counts. It also presents a small set of recurring techniques, such as divide and conquer, greedy choice, and breaking problems into stored subproblems, as tools a working programmer can recognise and apply.

Written by Claude from what it knows of this book.

What Hacker News says 71% recommend · 2% critical

05102014202020252016 peak · 10
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say 4.08 from 13 ratings

  1. 54
  2. 46
  3. 33
  4. 20
  5. 10
  • 96 want to read
  • 3 reading
  • 20 have read

Only 13 ratings: treat the average as a hint.

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
2016
ISBN
9781617292231
Editions known
2 at Open Library
Open Library
OL19546865W

AlgorithmusComputer algorithmsComputer programmingHandbooks, manualsProgrammierung

Explore in the mosaic

Read next: its neighbours on the mosaic