By Aditya Bhargava
Grokking Algorithms is an absolutely illustrated, pleasant consultant that teaches you ways to use universal algorithms to the sensible difficulties you face on a daily basis as a programmer. you are going to begin with sorting and looking out and, as you building up your abilities in pondering algorithmically, you are going to take on extra advanced matters corresponding to info compression and synthetic intelligence. every one conscientiously offered instance contains necessary diagrams and entirely annotated code samples in Python.
Purchase of the print publication encompasses a loose publication in PDF, Kindle, and ePub codecs from Manning Publications.
About the Technology
An set of rules is not anything greater than a step by step approach for fixing an issue. The algorithms you will use most of the time as a programmer have already been came across, proven, and confirmed. so that you can comprehend them yet refuse to slog via dense multipage proofs, this can be the publication for you. This absolutely illustrated and interesting consultant makes it effortless to profit the best way to use an important algorithms successfully on your personal programs.
About the Book
Grokking Algorithms is a pleasant tackle this center machine technology subject. In it, you are going to how to follow universal algorithms to the sensible programming difficulties you face each day. you will begin with projects like sorting and looking out. As you increase your talents, you are going to take on extra complicated difficulties like information compression and synthetic intelligence. every one rigorously awarded instance contains precious diagrams and entirely annotated code samples in Python. by means of the top of this publication, you've mastered greatly acceptable algorithms in addition to how and while to take advantage of them.
- Covers seek, style, and graph algorithms
- Over four hundred photographs with specific walkthroughs
- Performance trade-offs among algorithms
- Python-based code samples
About the Reader
This easy-to-read, picture-heavy creation is appropriate for self-taught programmers, engineers, or an individual who desires to brush up on algorithms.
About the Author
Aditya Bhargava is a software program Engineer with a twin history in laptop technological know-how and advantageous Arts. He blogs on programming at adit.io.
Table of Contents
- Introduction to algorithms
- Selection sort
- Hash tables
- Breadth-first search
- Dijkstra’s algorithm
- Greedy algorithms
- Dynamic programming
- K-nearest neighbors