Solving Mazes with Swift

From Classic Computer Science Problems in Swift by David Kopec

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.

Working with Dijkstra’s Algorithm

From Grokking Algorithms
By Aditya Y. Bhargava

Animations from Grokking Algorithms

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

The Set Covering Problem: finding the smallest set of radio stations that serve all of the 50 states

From Grokking Algorithms
The set covering problem: finding the smallest set of radio stations that serve all of the 50 states

The need for classification

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)

Understanding the concept of recursion

bhargava-headThere 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)

Introduction to Graphs

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)

© 2022 Manning — Design Credits