From Classic Computer Science Problems in Swift by David Kopec
This article will teach you how to use the minimax algorithm to create a Tic-Tac-Toe AI that plays the game flawlessly.
By Beau Carnes
This article is all about finding a path through mazes, which is an analogous to many common search problems in computer science. Examples are in Swift.
By David Kopec
By Aditya Y. Bhargava
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 YouTube
From Grokking Algorithms
By Douglas G. McIlwraith, Haralambos Marmanis, and Dmitry Babenko
In this article, excerpted from Algorithms of the Intelligent Web, Second Edition , we will talk about how we use classification everywhere.
The need for classification (PDF)
There are many important algorithms that use recursion, so it is important to understand the concept. In this article by Aditya Bhargava, author of Grokking Algorithms, we explore the concept of recursion.
Understanding the concept of recursion (PDF)
In this article Aditya Y. Bhargava, author of Grokking Algorithms introduces graphs (what they are) Hint: they don’t involve an X or Y axis). Then he will show you your first graph algorithm.
Introduction to Graphs (PDF)
© 2018 Manning — Design Credits