Interactive Visualisations

Don't Just Read Algorithms.
Watch Them Think.

Most people forget code in a week. These animations make you understand the logic — now with interactive quizzes and multi-language code.

🎯14 Interactive Algorithms

🧠Quizzes included

💻PY / C++ / JS / JAVA

🆓100% free

Pick an algorithm and start →

🔍

Searching

How do computers find things fast?

2 algorithms

Check every element, one by one. ★ New: Quizzes!

Easy O(n) ⏱ ~3 min

Eliminate half the array each step. 1 billion items? 30 steps.

Easy O(log n) ⏱ ~5 min

📊

Sorting

The algorithms every programmer must know cold

6 algorithms

Watch the largest value "bubble" to the top, pass after pass.

Easy O(n²) ⏱ ~4 min

Pick the minimum. Place it. Repeat. Satisfyingly methodical.

Easy O(n²) ⏱ ~4 min

Like sorting cards in your hand — builds sorted order piece by piece.

Easy O(n²) ⏱ ~5 min

Divide, sort, merge. The divide-and-conquer champion.

Medium O(n log n) ⏱ ~6 min

Choose a pivot. Partition. Recurse. The fastest in practice.

Medium O(n log n) ⏱ ~7 min

Build a max-heap, extract the top. Guaranteed O(n log n) every time.

Medium O(n log n) ⏱ ~7 min

🗂️

Data Structures

How data is organised changes everything

3 structures

Last in, first out. Powers undo/redo, recursion, and browsers.

Easy O(1) ⏱ ~4 min

First in, first out. The backbone of scheduling and BFS.

Easy O(1) ⏱ ~4 min

Nodes connected by pointers. Dynamic, flexible, non-contiguous.

Medium O(n) ⏱ ~6 min

🌳

Trees

Hierarchical thinking unlocks advanced algorithms

1 structure

Binary Search Tree

Insert. Search. Delete. Watch the tree reshape itself in real time.

Medium O(log n) ⏱ ~8 min

🕸️

Graphs

Traverse any network — maps, social connections, compilers

2 algorithms

Breadth-First Search

Explore level by level using a queue. Finds shortest path in unweighted graphs.

Medium O(V+E) ⏱ ~6 min

Depth-First Search

Dive deep, then backtrack. Powers maze-solving and topological sort.

Medium O(V+E) ⏱ ~6 min