Description
Summary
Grokking Algorithms is a fully illustrated, friendly guide that teaches you how to apply common algorithms to the practical problems you face each day as a programmer. You’ll be able to start with sorting and searching and, as you build up your skills in thinking algorithmically, You’ll be able to tackle more complex concerns such as data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python.
Learning about algorithms doesn’t must be boring! Get a sneak peek at the fun, illustrated, and friendly examples You’ll be able to find in Grokking Algorithms on Manning Publications’ YouTube channel.
Purchase of the print book includes a free eBook in PDF, Kindle, and ePub formats from Manning Publications.
About the Technology
An algorithm is nothing more than a step by step procedure for solving a problem. The algorithms You’ll be able to use most continuously as a programmer have already been discovered, tested, and proven. If you wish to keep in mind them but refuse to slog through dense multipage proofs, this is the book for you. This fully illustrated and engaging guide makes it easy to learn to use an important algorithms effectively in your own programs.
About the Book
Grokking Algorithms is a friendly take on this core computer science topic. In it, You’ll be able to learn to apply common algorithms to the practical programming problems you face each day. You’ll be able to start with tasks like sorting and searching. As you build up your skills, You’ll be able to tackle more complex problems like data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python. By the end of this book, you are going to have mastered widely applicable algorithms as well as how and when to use them.
What’s Inside
- Covers search, sort, and graph algorithms
- Over 400 pictures with detailed walkthroughs
- Performance trade-offs between algorithms
- Python-based code samples
About the Reader
This easy-to-read, picture-heavy introduction is suitable for self-taught programmers, engineers, or anyone who wants to brush up on algorithms.
About the Author
Aditya Bhargava is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io.
Table of Contents
- Introduction to algorithms
- Selection sort
- Recursion
- Quicksort
- Hash tables
- Breadth-first search
- Dijkstra’s algorithm
- Greedy algorithms
- Dynamic programming
- K-nearest neighbors
, Burgundy&url=https://www.communityconnection.us/product/lorren-home-trends-57-piece-mabel-bone-china-dinnerware-set-service-for-8-people-burgundy/&media=https://images-na.ssl-images-amazon.com/images/I/41AimBATwpL._SS1024_.jpg){kind=link}
, Gold&url=https://www.communityconnection.us/product/lorren-home-trends-57-piece-chloe-bone-china-dinnerware-set-service-for-8-people-gold/&media=https://images-na.ssl-images-amazon.com/images/I/41vAh7TCsTL._SS1024_.jpg){kind=link}
, Amber&url=https://www.communityconnection.us/product/gibson-elite-ocean-paradise-square-dinnerware-set-service-for-4-16pcs-amber/&media=https://images-na.ssl-images-amazon.com/images/I/416%2B-aF7XVL._SS1024_.jpg){kind=link}
&url=https://www.communityconnection.us/product/pfaltzgraff-french-lace-white-dinnerware-set-32-piece/&media=https://images-na.ssl-images-amazon.com/images/I/41Exlads5TL._SS1024_.jpg){kind=link}
