Sorting Algorithms

Watch classic sorting algorithms visualized step by step

Unsorted Comparing Swapping Sorted

Pathfinding Algorithms

Draw walls, set start/end, run A* or Dijkstra

Start End Wall Explored Path

Binary Search Tree

Insert values to build a BST, then visualize traversal order

Graph Traversal

Click canvas to add nodes · Drag from node to node to create edges · Run BFS or DFS

Click canvas to add nodes. Drag between nodes to add edges. Select a start node (click while holding Shift) then run.