A* Search: How Your Map Applications Find Shortest Routes

The Discrete Fourier Transform: Most Important Algorithm Ever?

The Traveling Salesman Problem: When Good Enough Beats Perfect

PageRank: A Trillion Dollar Algorithm

How PNG Works: Compromising Speed for Quality

The Unreasonable Effectiveness of JPEG: A Signal Processing Approach

How Computers Draw Weird Shapes (Marching Squares)

Huffman Codes: An Information Theory Perspective

A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)

Building Collision Simulations: An Introduction to Computer Graphics

FFT Example: Unraveling the Recursion

The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?

Breadth First Search (BFS): Visualized and Explained

5 Simple Steps for Solving Dynamic Programming Problems

Depth First Search (DFS) Explained: Algorithm, Examples, and Code

Introduction to Graph Theory: A Computer Science Perspective

Towers of Hanoi: A Complete Recursive Visualization

What Is Big O Notation?

5 Simple Steps for Solving Any Recursive Problem

The Simple and Elegant Idea behind Efficient Dynamic Arrays

What if you had to invent a dynamic array?

What Actually Is a Data Structure?

A Preview for Data Structures and Algorithms