Manning Publications Grokking Algorithms: An illustrated guide for programmers and other curious people

Grokking Algorithms by Aditya is a gem! 📚 The book's use of visuals and examples makes learning algorithms a breeze. Perfect for beginners looking to make a strong foundation.

The book is well written and easy to follow. The book covers all major algorithms, must read for beginners

Very good explanation of algorithms sigh best pictorial explanation

It's a great book for those who are learning programming in their early days, as it explains concepts in a clear and easy-to-understand manner. However, it's very heart breaking to see that I just got the book two days ago, and the pages have already started coming loose due to weak binding. This makes it difficult to keep the book in good condition. It would be much better if the publisher improved the binding quality for better durability.

"Grokking Algorithms" is an excellent book to start your Data Structure and Algorithm learning. I wanted to learn DSA for a very long time and bought so many highest-rated books from Amazon but never able to read it through for more than 50 Pages. But the storytelling type of writing used in this book makes it so easy to read through. This book doesn't cover all the Data Structures and Algorithms. It's primarily an Algorithm book which includes most popular Algorithms only. But aware of the price, it's very costly in Amazon. I would suggest you buy it from the official publisher's website. They have various options for a lower price point.

the introductory book on data structure and algorithms....its like a story book.go for it if u want to know and apply ds and algorithms from scratch.

This was my first algorithm book. Perhaps I'm biased due to the fact that I tried some pretty dense books, and failed miserably. But this one, was a gem. It was a fun read, right up there in the league of Head First Java

Concepts are expalined neat. Great book to start with, for algorithms. But I also feel it is over priced.

If you are new to data structures and algorithms, I guarantee that you find this book a helpful resource with a single caveat: make sure you are the target audience. From the author: "Who should read this book? This book is aimed at anyone who knows the basics of coding and wants to understand algorithms. Maybe you already have a coding problem and are trying to find an algorithmic solution. Or maybe you want to understand what algorithms are useful for. Here’s a short, incomplete list of people who will probably find this book useful: • Hobbyist coders • Coding boot camp students • Computer science grads looking for a refresher • Physics/math/other grads who are interested in programming" In my opinion, the reason this book is so much better than traditional resources on the subject is that the author adheres to a few basic principles that I find fundamental to learning. From the author: "About this book This book is designed to be easy to follow. I avoid big leaps of thought. Any time a new concept is introduced, I explain it right away or tell you when I’ll explain it. Core concepts are reinforced with exercises and multiple explanations so that you can check your assumptions and make sure you’re following along. I lead with examples. Instead of writing symbol soup, my goal is to make it easy for you to visualize these concepts. I also think we learn best by being able to recall something we already know, and examples make recall easier. So when you’re trying to remember the difference between arrays and linked lists (explained in chapter 2), you can just think about getting seated for a movie. Also, at the risk of stating the obvious, I’m a visual learner. This book is chock-full of images. The contents of the book are carefully curated. There’s no need to write a book that covers every sorting algorithm—that’s why we have Wikipedia and Khan Academy. All the algorithms I’ve included are practical. I’ve found them useful in my job as a so ware engineer, and they provide a good foundation for more complex topics." The book starts with simple concrete examples and then moves towards abstraction. Most books on the subject start with abstract mathematical equations (symbol soup as the author calls it) and then move towards concrete implementations (or just stay with abstract proofs). That is approach is completely backwards to me, but perhaps it works well for others.

The book just arrived and I’m truly amazed. I’m a python developer with 3 years of experience but in my job I never had the opportunity to get in deep with some algorithmical problems or particular structures (that’s probably one of the downsides of coding in Python, with C++ I would have surely needed to learn these in the early stages). So, I’m preparing for an interview and I already had Cracking the coding interview at home (since years!) but I was never able to really get through it without getting bored and dropout, or feeling I was missing something. I bought Grokking algorithms after a youtube recommendation and I feel like I’ve finally found the golden ticket of my learning strategy. This book looks too easy and maybe naive at the beginning but in the second chapter you start getting a real grasp of concepts that were really un-teached in Cracking the Coding interview or similar books. I think it’s super important to first get the large picture and the answers to “why do I need this?” “why did they invented it in the first place?” and THEN get through the serious implementation. This books does it and I’m happy for the purchase! (Above, a comparison of the two books over the same topic)

Grokking Algorithms does a very good job of providing a gentle introduction to algorithms. This is probably one of the best beginner-friendly books about algorithms you can find out there. But If you are already familiar with the topic then this book adds almost nothing to you because you probably already know all the material presented in the book.

Easy to read, easy to understand and to enjoy. Excellent to brush up or reinforce previous knowledge.

Very nicely written and illustrative. It explains algorithms in graphics and easy to follow explanations and simple Python code.