Grokking Algorithms An Illustrated Guide For Programmers and Other Curious People

Grokking Algorithms An Illustrated Guide For Programmers and Other Curious People

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 take a hard pass on Knuth's brilliant but impenetrable theories and the dense multi-page proofs you'll find in most textbooks, this is the book for you. This fully-illustrated and engaging guide makes it easy for you to learn how to use algorithms effectively in your own programs.

Grokking Algorithms is a disarming take on a core computer science topic. In it, you'll learn how to apply common algorithms to the practical problems you face in day-to-day life as a programmer. You'll start with problems like sorting and searching. As you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression or artificial intelligence. Whether you're writing business software, video games, mobile apps, or system utilities, you'll learn algorithmic techniques for solving problems that you thought were out of your grasp. For example, you'll be able to:
Write a spell checker using graph algorithms
Understand how data compression works using Huffman coding
Identify problems that take too long to solve with naive algorithms, and attack them with algorithms that give you an approximate answer instead
Each carefully-presented example includes helpful diagrams and fully-annotated code samples in Python. By the end of this book, you will know some of the most widely applicable algorithms as well as how and when to use them.

Title:Grokking Algorithms An Illustrated Guide For Programmers and Other Curious People
Edition Language:English
ISBN:9781617292231

    Grokking Algorithms An Illustrated Guide For Programmers and Other Curious People Reviews

  • Tim

    Professional programmers aren't going to learn anything new from this book, but it was a fun read regardless. What struck me as great about this book, is it reads like an ELI5 about algorithms and dat...

  • Maru Kun

    Studying algorithms is a lot like studying accountancy - profoundly boring on the surface and still quite boring if you dig beneath. However, if you spend a lot of effort and dig down far enough algor...

  • Rachel

    The best book I've ever read on algorithms. Also the only book I've ever read on algorithms, but probably for a good reason. ...

  • Tomy Jaya

    I absolutely love the author's visual approach to teaching algorithms. Coupled with a plethora of examples, the bite-sized chapters in this book are ideal for people like me to follow. I would highly ...

  • Bharat

    The visual way of explaining algorithms as seen in this book is very appealing and pretty good and one can easily breeze through the content. Human brains grasp visual narrations better. Can be a star...

  • Diego Garcia

    A simple and nice introduction to most popular algorithms, if you wanna to know what is an algorithm and which ones are most popular, that is a good book, but if you're looking for a book to help you ...

  • David

    A quick engaging introductory read on an important topic. While I'd love to think that I could pick up some authoritative algorithm textbook, my experience self-studying suggests I might not get that ...

  • Vishwanath

    Refreshing new presentation of algorithms. I was intrigued by the visual premise of the book especially at a time when I was looking for a refresher on algorithms. This book is an enjoyable journey th...

  • Ananth

    Dont have a CS background and ever wondered what that O(logn) stood for. Fear not, Aditya has your back covered. I have tried several times to learn the basic algorithms and their respective time comp...

  • Matt Grommes

    I read this through the Manning MEAP program. I thoroughly enjoyed it. My only complaint really is that I wish the tree section could have been longer but that might be changed by publication time. I'...