Grokking Algorithms An Illustrated Guide For Programmers and ... by Aditya Y. Bhargava

While graphs and their algorithms can be considered more advanced, the author does a great job of explaining them with extensive use of visualizations.Ĭhapter 7 presents Dijkstra’s algorithm, again in a very visual and graspable manner and shows when and when not to use it. In chapter 6, the reader is introduced to graphs and the Breadth-first search algorithm to find shortest paths. In chapter 5, Aditya Bhargava talks about Hash tables, their use cases, collisions and performance considerations. This is followed by a comparison of different sorting algorithms and some more explanations about Big O notation. Having covered these basic topics, chapter 4 dives into the Divide & conquer approach to solving problems and explains it using the Quicksort algorithm. The third chapter deals with Recursion and how it affects the call stack of a program. In the second chapter, he talks about Arrays and Linked lists and then presents the Selection sort algorithm.

Then he explains Binary search and introduces the reader to Big O notation. In the first chapter, Introduction to algorithms, the author gives an overview of the algorithms you will learn in this book and what to expect from this book. Since they are written in Python, they look very similar to pseudo-code and it should be easy to implement them in any other language. That being said, there are short code examples for each algorithm. This makes understanding these algorithms much easier since you can walk through them without writing a single line of code. In his book, Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People, Aditya Bhargava tries to explain several basic algorithms in a very visual and graspable way.įor every algorithm presented, there are several graphics the reader can follow along.

Grokking Algorithms An Illustrated Guide For Programmers and ... by Aditya Y. Bhargava