Grokking Algorithms: An illustrated guide for programmers and other curious people - Couverture souple

Bhargava, Aditya

Couverture souple

ISBN 10 : 1617292230 ISBN 13 : 9781617292231

Editeur : Manning, 2016

Synopsis

Summary

Grokking Algorithms is a fully illustrated, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. You'll start with sorting and searching and, as you build up your skills in thinking algorithmically, you'll 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 have to be boring! Get a sneak peek at the fun, illustrated, and friendly examples you'll find in Grokking Algorithms on Manning Publications' YouTube channel.

Continue your journey into the world of algorithms with Algorithms in Motion, a practical, hands-on video course available exclusively at Manning.com (www.manning.com/livevideo/algorithms-​in-motion).

About the Technology

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 understand 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 how to use the most 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 learn how to apply common algorithms to the practical programming problems you face every day. You'll start with tasks like sorting and searching. As you build up your skills, you'll 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 will 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

1. Introduction to algorithms
2. Selection sort
3. Recursion
4. Quicksort
5. Hash tables
6. Breadth-first search
7. Dijkstra's algorithm
8. Greedy algorithms
9. Dynamic programming
10. K-nearest neighbors

A propos du livre

À propos de l'auteur

Aditya Bhargava is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io.

À propos de la quatrième de couverture

Algorithms nothing more than step-by-step procedures for solving problems and most algorithms used by programmers have already been discovered, tested, and proven. Those wanting to take a hard pass on Knuth's brilliant but impenetrable theories, and the dense multi-page proofs found in most textbooks, will want to read  Grokking Algorithms. This fully-illustrated and engaging guide makes it easy to learn how to use algorithms effectively.

Grokking Algorithms is a disarming take on a core computer science topic and shows readers how to apply common algorithms to practical problems faced in the day-to-day life of a programmer. It starts with problems like sorting and searching and builds up skills in thinking algorithmically. Then it tackles more complex concerns such as data compression or artificial intelligence. Whether writing business software, video games, mobile apps, or system utilities, readers will learn algorithmic techniques for solving problems that they thought were out of reach. By the end of this book, they will know some of the most widely applicable algorithms, as well as how and when to use them.

Détails de l'édition

• Éditeur: Manning
• Date d'édition: 2016
• Langue: anglais
• ISBN 10: 1617292230
• ISBN 13: 9781617292231
• Reliure: Broché
• Numéro d'édition: 1
• Nombre de pages: 256
• Coordonnées du fabricant: non disponible
• Personne responsable: Simon and Schuster Netherlands BV, GPSR Europäische Union; info@simonandschuster.nl; ; Herculesplein 96; Utrecht; 3584 AA; Pays-Bas