Grokking Algorithms

Narrated by: Derek Lettman
Length: 3 hrs and 46 mins
4.3 out of 5 stars (58 ratings)

Audible Premium Plus

$14.95 a month

1 audiobook of your choice.
Stream or download thousands of included titles.
$14.95 a month after 30 days. Cancel anytime.
Buy for $14.95

Buy for $14.95

Pay using card ending in
By confirming your purchase, you agree to Audible's Conditions of Use and Amazon's Privacy Notice. Taxes where applicable.

Publisher's Summary

Grokking Algorithms is a friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. You'll start with sorting and searching and, as you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression and artificial intelligence. Learning about algorithms doesn't have to be boring!

An algorithm is nothing more than a step-by-step procedure for solving a problem. The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. If you want to understand them but refuse to slog through dense multipage proofs, this is the book for you. This engaging guide makes it easy to learn how to use the most important algorithms effectively in your own programs.

Contents include:

  • Introduction to algorithms
  • Selection sort
  • Recursion
  • Quicksort
  • Hash tables
  • Breadth-first search
  • Dijkstra's algorithm
  • Greedy algorithms
  • Dynamic programming
  • K-nearest neighbors  

This accessible introduction is suitable for self-taught programmers, engineers, or anyone who wants to brush up on algorithms. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python.

Aditya Bhargava is a software engineer with a dual background in computer science and fine arts. He blogs on programming at adit.io.

PLEASE NOTE: When you purchase this title, the accompanying PDF will be available in your Audible Library along with the audio. 

©2016 Manning Publications (P)2016 Manning Publications

What listeners say about Grokking Algorithms

Average Customer Ratings
Overall
  • 4.5 out of 5 stars
  • 5 Stars
    32
  • 4 Stars
    16
  • 3 Stars
    5
  • 2 Stars
    3
  • 1 Stars
    2
Performance
  • 4.5 out of 5 stars
  • 5 Stars
    31
  • 4 Stars
    14
  • 3 Stars
    3
  • 2 Stars
    2
  • 1 Stars
    2
Story
  • 4 out of 5 stars
  • 5 Stars
    28
  • 4 Stars
    12
  • 3 Stars
    4
  • 2 Stars
    5
  • 1 Stars
    1

Reviews - Please select the tabs below to change the source of reviews.

Sort by:
Filter by:
  • Overall
    1 out of 5 stars
  • Performance
    5 out of 5 stars

the book is not good in audio format

the book is good, but the author keeps talking about things from graphs or from things you should be seeing on the printed format which is not part of the audio book. I recommend this book in the printed format but I highly advice against the audiobook format

11 people found this helpful

  • Overall
    4 out of 5 stars
  • Performance
    4 out of 5 stars
  • Story
    4 out of 5 stars

Good, but feels very surface-level

I wish there were more books like this. This was well-written and kept my attention. That being said, it’s hard to say how much concrete information I’m walking away with after listening to this.

6 people found this helpful

  • Overall
    5 out of 5 stars
  • Performance
    5 out of 5 stars
  • Story
    5 out of 5 stars

Great Book

A great book and easy to understand. The author is really breaking down a complex topic into small understandable chunks. A must read for any newbie on algorithms. However, I went back to buy the printed version. I don't recommend having an audiobook to learn algorims. Yes, I mad this mistake but you should not do the same.

3 people found this helpful

  • Overall
    5 out of 5 stars
  • Performance
    5 out of 5 stars
  • Story
    5 out of 5 stars

Great introduction to algorithms!

Very pedagogical and interesting book on algorithms! Absolutely loved it. You get a pdf with all the code and pictures, so it’s totally fine as an audio book.

1 person found this helpful

  • Overall
    5 out of 5 stars
  • Performance
    5 out of 5 stars
  • Story
    4 out of 5 stars

Like computer yoga, or a meditation guide

The content is delivered directly and slowly. If you're completely new to programming, I recommend this book once a month while working on some textbook projects. This is not a comprehensive guide to algorithmic problem solving, nor is it an exploration of implementations. There will be a point when the utility of grokking algorithms diminishes. I would prefer an audio book form of stepanov and rose, but this is still a welcome addition to my cassette collection.

  • Overall
    5 out of 5 stars
  • Performance
    5 out of 5 stars
  • Story
    5 out of 5 stars

Absolutely AMAZING!

Informative and well presented! It is a MUST-READ for anyone willing to acquire a strong foundation in Data Structures & Algorithms

Sort by:
Filter by:
  • Overall
    4 out of 5 stars
  • Performance
    4 out of 5 stars
  • Story
    5 out of 5 stars
Profile Image for Traveling_steve
  • Traveling_steve
  • 08-27-20

A helpful audiobook.. but the attached PDF is poor

Okay, I only recently purchased this book and have been listening though as it is well paced, clearly worded and interesting topics. I think the author has chosen some accessible problems and examples to keep interest without distraction and I am overall very glad I made the purchase. However: The pdf that comes with the audiobook is ONLY the images from the original book. There are broken links in the to what I assume is an online version of the book. This is a problem as the detail in the book are not complemented with what is provided and eventually I was forced to ALSO purchase the digital version of the textbook to accompany the audiobook. I feel somewhat irritated that I had to buy this book twice as a result. So my recommendation is buy the text book first and then only purchase the audiobook if you feel it would be of benefit to have the information read out as you code.

1 person found this helpful