Algorithm Playground

Ten classical CS algorithms · interactive · pure browser · no build tooling

Pick a card. Each demo runs entirely in your browser — no installs, no server, no LLM API.

Bubble · Insertion · Selection · Merge · Quick · Heap — six algorithms racing on the same array, side by side.

02 · PATHFINDING

A* · Dijkstra · BFS · DFS on a grid with click-to-place walls. Watch each algorithm's exploration and final path.

03 · MAZE GENERATION

Maze Generation

DFS recursive · Prim's · Kruskal's · Wilson's — four algorithms carve mazes with visually distinct styles.

04 · GRAPH TRAVERSAL

Graph Traversal & Topology

Build a directed graph with clicks; watch BFS / DFS / topological sort / Tarjan SCC colour the nodes by depth, order, and component.

05 · BALANCED TREES

Self-Balancing Trees

BST vs AVL vs Red-Black — same insertion sequence, side by side. Watch the rotations keep the height in check.

06 · HASH TABLES

Chaining · linear probing · cuckoo hashing — slide load factor up and watch collision density shape the bucket distribution.

07 · HEAP & PQ

Heap & Priority Queue

Binary heap as an array — sift-up / sift-down animated, plus a heapsort vs quicksort race using the same data.

08 · DYNAMIC PROGRAMMING

LCS · edit distance · 0/1 knapsack — DP table fills cell by cell; traceback path lit up in red.

09 · STRING MATCHING

String Matching

KMP failure function build + matching with mismatch jumps, side-by-side with naive O(nm). Watch where the magic happens.

Computational Geometry

Click anywhere to place points; Graham-scan convex hull re-computes live, plus angular-sort traces.

ABOUT THIS SITE

Each demo is a single self-contained HTML file plus a small JS file — no React, no Vue, no bundler, no npm install. Open any file in a browser, it just works. Source code is on GitHub; contributions and corrections welcome via PR.