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.

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 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

1. K-nearest neighbors

2. 
   
3. Grokking Algorithms》是一本图文并茂的友好指南，教你如何将常见的算法应用于你作为程序员每天都要面对的实际问题。你将从排序和搜索开始，随着你的算法思维能力的提高，你将解决更复杂的问题，如数据压缩和人工智能。每个精心介绍的例子都包括有用的图表和完全注释的Python代码样本。
4. 
   
5. 学习算法不一定是枯燥的! 在Manning Publications的YouTube频道上，你可以先睹为快地了解一下《Grokking Algorithms》中那些有趣的、有图有真相的、友好的例子。
6. 
   
7. 购买印刷版图书包括曼宁出版社提供的PDF、Kindle和ePub格式的免费电子书。
8. 
   
9. 关于技术
10. 
    
11. 算法不过是解决一个问题的分步程序。作为一名程序员，你最常使用的算法已经被发现、测试和证明。如果你想了解它们，但又拒绝阅读密集的多页证明，那么这本书就适合你。这本图文并茂、引人入胜的指南让你轻松学会如何在自己的程序中有效使用最重要的算法。
12. 
    
13. 关于这本书
14. 
    
15. Grokking Algorithms》是对这一核心计算机科学主题的友好诠释。在书中，你将学习如何将常见的算法应用于你每天面临的实际编程问题。你将从排序和搜索等任务开始。随着你技能的提高，你将解决更复杂的问题，如数据压缩和人工智能。每个精心介绍的例子都包括有用的图表和完全注释的Python代码样本。在本书结束时，你将掌握广泛适用的算法，以及如何和何时使用这些算法。
16. 
    
17. 书中内容
18. 
    
19. 涵盖搜索、排序和图算法
20. 超过400张图片的详细演练
21. 各种算法之间的性能权衡
22. 基于Python的代码样本
23. 关于读者
24. 
    
25. 这本简单易懂、图文并茂的介绍适合于自学成才的程序员、工程师或任何想学习算法的人。
26. 
    
27. 关于作者
28. 
    
29. Aditya Bhargava是一名软件工程师，拥有计算机科学和美术的双重背景。他在adit.io发表关于编程的博客。
30. 
    
31. 目录
32. 
    
33. 算法简介
34. 选择排序
35. 递归
36. 快速排序
37. 哈希表
38. 广度优先搜索
39. 迪克斯特拉的算法
40. 贪婪算法
41. 动态编程
42. K-最近的邻居