15 Algorithms · 3 Languages · Step-by-Step

Visualize
Competitive Programming
Algorithms

Interactive step-by-step visualizations of essential USACO techniques. See the code execute, understand the logic, master the patterns.

Algorithms

Languages

Step-by-Step Execution

Walk through each algorithm one operation at a time. See exactly how pointers move, elements swap, and data structures evolve.

</>

Code Highlighting

Watch the relevant code lines light up as each step executes. Available in Python, C++, and Java with detailed explanations.

★

USACO Focused

Every technique is chosen for its relevance to competitive programming, from Bronze fundamentals to Gold-level graph algorithms.

Binary Search

Searching & Arrays

Efficiently finds a target value in a sorted array by repeatedly dividing the search interval in half.

Input:

Target:

Window:

Speed: 500ms

Click "Initialize" to set up the algorithm, then step through or auto-run.

Visualization

Complexity Analysis

Best Case O(1)

Average Case O(log n)

Worst Case O(log n)

Space O(1)

Implementation

About This Project

What is this?

CP Algorithm Visualizer is an interactive tool for understanding competitive programming algorithms. It lets you step through 15 essential techniques one operation at a time, watching pointers move, elements swap, and data structures evolve in real time.

Who is it for?

Anyone preparing for USACO, Codeforces, or competitive programming in general. Whether you're just starting with Bronze-level sorting or tackling Gold-level graph algorithms and DP, the visualizations help build intuition that's hard to get from reading code alone.

Features

15 algorithms across 4 categories: Searching & Arrays, Sorting, Graphs, and Advanced Techniques
Step-by-step execution with smooth animations showing exactly what happens each operation
Code highlighting that follows along with each step in Python, C++, and Java
Concept explanations that break down the core idea before you dive into the visualization
Custom inputs so you can test edge cases and build deeper understanding
Complexity analysis for every algorithm with best, average, worst, and space breakdowns

Algorithms Covered

Searching & Arrays

Binary Search, Two Pointers, Prefix Sums, Sliding Window

Sorting

Bubble, Selection, Insertion, Merge, Quick Sort

Graph Algorithms

BFS, DFS, Dijkstra's, Topological Sort

Advanced

Union-Find (DSU), DP: Longest Increasing Subsequence

Tech Stack

Pure HTML, CSS, and JavaScript. No frameworks, no dependencies, no build step. Just open and use.

Visualize Competitive Programming Algorithms

Step-by-Step Execution

Code Highlighting

USACO Focused

Binary Search

How It Works

Visualization

Complexity Analysis

Implementation

About This Project

What is this?

Who is it for?

Features

Algorithms Covered

Searching & Arrays

Sorting

Graph Algorithms

Advanced

Tech Stack

Visualize
Competitive Programming
Algorithms