Grokking Algorithms, Second Edition

A friendly, fully-illustrated introduction to the most important computer programming algorithms.

The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. This book will prepare you for those pesky algorithms questions in every programming job interview and help you apply them in your day-to-day work. And if you want to understand them without slogging through dense multipage proofs, this is the book for you.

In Grokking Algorithms, Second Edition you will discover:

• Search, sort, and graph algorithms
• Data structures such as arrays, lists, hash tables, trees, and graphs
• NP complete and greedy algorithms
• Performance trade-offs between algorithms
• Exercises and code samples in every chapter
• Over 400 illustrations with detailed walkthroughs

The first edition of Grokking Algorithms proved to over 100,000 readers that learning algorithms doesn't have to be complicated or boring! This new edition now includes fresh coverage of trees, NP complete problems, and code updates to Python 3. With easy-to-read, friendly explanations, clever examples, and exercises to sharpen your skills as you learn, you'll actually enjoy learning these important algorithms.

About the book

Grokking Algorithms, Second Edition makes it easy to learn. You'll never be bored--complex concepts are all explained through fun cartoons and memorable examples that make them stick. You'll start with tasks like sorting and searching, then build your skills to tackle more advanced problems like data compression and artificial intelligence.

This revised second edition contains brand new coverage of trees, including binary search trees, balanced trees, B-trees and more. You'll also discover fresh insights on data structure performance that takes account of modern CPUs. Plus, the book's fully annotated code samples have been updated to Python 3. By the time you reach the last page, you'll have mastered the most widely applicable algorithms, know when and how to use them, and be fully prepared when you're asked about them on your next job interview.

About the reader

Suitable for self-taught programmers, engineers, job seekers, 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.

一本友善且豐富插圖的介紹最重要的電腦程式設計演算法的書籍。

作為一名程式設計師，你最常使用的演算法已經被發現、測試和證明過。這本書將為你在每次程式設計工作面試中遇到的棘手演算法問題做好準備，並幫助你在日常工作中應用它們。如果你想要理解這些演算法，而不是苦苦閱讀密集的多頁證明，這本書就是為你而寫的。

在《Grokking Algorithms, 第二版》中，你將會發現：

- 搜尋、排序和圖形演算法
- 陣列、串列、雜湊表、樹和圖等資料結構
- NP完全和貪婪演算法
- 演算法之間的效能取捨
- 每章節都有練習和程式碼範例
- 超過400張詳細解說的插圖

《Grokking Algorithms》第一版已經向超過10萬名讀者證明，學習演算法並不一定複雜或無聊！這本新版現在包含了對樹、NP完全問題的全新涵蓋範圍，以及對Python 3的程式碼更新。通過易於閱讀的友善解釋、巧妙的例子和練習，你將真正享受學習這些重要的演算法。

關於本書：

《Grokking Algorithms, 第二版》讓學習變得容易。你永遠不會感到無聊，因為複雜的概念都通過有趣的卡通和令人難忘的例子來解釋，讓它們牢記在心。你將從排序和搜尋等任務開始，然後逐步提升技能，解決更高級的問題，如資料壓縮和人工智慧。

這本修訂的第二版包含全新的樹涵蓋範圍，包括二元搜尋樹、平衡樹、B樹等。你還將發現關於資料結構效能的新見解，考慮到現代CPU的特點。此外，本書的程式碼範例已經更新到Python 3。當你讀到最後一頁時，你將掌握最廣泛應用的演算法，知道何時以及如何使用它們，在下一次工作面試中完全準備好回答相關問題。

關於讀者：

適合自學程式設計師、工程師、求職者或任何想要複習演算法的人。

關於作者：

Aditya Bhargava是一位具有計算機科學和美術雙重背景的軟體工程師。他在adit.io上撰寫有關程式設計的部落格。

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

Aditya Bhargava 是一位具有雙重背景的軟體工程師，他在計算機科學和美術方面都有相關學習經歷。他在 adit.io 上撰寫有關程式設計的部落格文章。