Interactive tool for visualizing and learning algorithms. Features sorting, pathfinding, graph traversal, tree traversal, dynamic programming, and heap operations visualizers.
Visualize sorting algorithms and understand comparisons, swaps, and efficiency.
Explore pathfinding algorithms with grid maps, obstacles, and dynamic start/end points.
Interactively test and visualize graph algorithms like BFS, DFS, and Dijkstra.
Visualize tree traversals and perform operations like insertion and balancing on BSTs.
Visualize dynamic programming problems and understand state transitions and optimal solutions.
Understand heap operations like insertion, deletion, and heapify for min and max heaps.