Algorithm Visualizations

Every page here runs real C++ and animates the actual execution — not a pre-recorded animation. Pick one, then run your own code the same way.

▶ Open DryRun

searching

Binary Search Visualization Linear Search Visualization

sorting

Bubble Sort Step by Step Selection Sort Visualization Insertion Sort Visualization How Merge Sort Works Quick Sort Visualization Counting Sort Visualization

arrays

The Two Pointers Technique The Sliding Window Algorithm Prefix Sum Explained Kadane's Algorithm Two Sum, Properly Explained Array Rotation In Place

linked-lists

Reversing a Linked List Detecting a Linked List Cycle Merging Two Sorted Linked Lists

stacks

Valid Parentheses with a Stack How a Stack Actually Works Next Greater Element with a Monotonic Stack

queues

How a Queue Actually Works

trees

Binary Tree Traversals Binary Search Trees Computing the Height of a Binary Tree Level Order Traversal

graphs

Breadth-First Search Depth-First Search Dijkstra's Shortest Path Algorithm Cycle Detection in a Directed Graph Topological Sort

recursion

How Recursion Actually Works

dynamic-programming

Fibonacci with Memoization Climbing Stairs The 0/1 Knapsack Problem