Algorithm Simulators

Learn Through Visualization

These interactive simulators help you understand how algorithms and data structures work by visualizing each step of the process. Click on any simulator to start exploring!

All simulators are built with vanilla JavaScript and HTML5 Canvas/SVG for optimal performance.

Graph Algorithms

A* Search

Visualize the A* pathfinding algorithm with different heuristics and obstacle configurations.

Pathfinding Heuristics Optimal Path

Launch Simulator Code

Breadth-First Search

Explore level-order traversal and shortest path finding in unweighted graphs.

Shortest Path Queue Level Order

Launch Simulator Code

Depth-First Search

Understand recursive and iterative DFS implementations with visualization.

Backtracking Stack Maze Solving

Launch Simulator Code

Data Structures

Binary Search Tree

Visualize insertion, deletion, and traversal operations on a BST.

Search Traversal Balancing

Launch Simulator Code

Min Heap

Understand heap operations including insert, extract-min, and heapify.

Priority Queue Heap Sort Efficiency

Launch Simulator Code

Linked List

Visualize node insertion, deletion, and traversal in linked lists.

Pointers Dynamic Operations

Launch Simulator Code

Sorting Algorithms

Quick Sort

Visualize the divide-and-conquer approach of this efficient sorting algorithm.

Divide & Conquer Pivot O(n log n)

Launch Simulator Code

Merge Sort

Understand the merging process of sorted subarrays in this stable sort.

Divide & Conquer Stable O(n log n)

Launch Simulator Code

Heap Sort

Visualize how a heap data structure can be used for efficient sorting.

In-place Heap O(n log n)

Launch Simulator Code

Computational Geometry

Convex Hull

Visualize Graham's scan or Jarvis march algorithms for convex hull.

Geometry Graham's Scan Jarvis March

Launch Simulator Code

More Simulators Coming Soon!

I'm continuously working on adding new algorithm visualizations.

Have a suggestion? Contact me with your ideas!