An interactive web application for visualizing sorting and pathfinding algorithms. This educational tool helps users understand how different algorithms work through step-by-step visual animations.
- Insertion Sort: A simple sorting algorithm that builds the final sorted array one item at a time
- Merge Sort: A divide-and-conquer algorithm with O(n log n) time complexity
- Quick Sort: An efficient sorting algorithm that uses a pivot element for partitioning
- Dijkstra's Algorithm: Guarantees the shortest path by visiting nodes with the smallest known distance first
- A Algorithm*: Uses a heuristic function to find paths more efficiently than Dijkstra's
- Algorithm Selection: Choose between different sorting and pathfinding algorithms
- Visualization Controls: Play, pause, reset, and step through algorithms
- Speed Control: Adjust the animation speed with a slider
- Custom Input: Enter your own data for sorting or create custom maze patterns for pathfinding
- Interactive Grid: Draw/erase walls, move start and end nodes, generate random obstacles
Check out the live demo: Algovithm Demo