Algorithm Visualiser
Watch six sorting algorithms and four pathfinding algorithms work, one step at a time, beside their real code in JavaScript, Python and C. Comparison and swap counts run alongside, and you can edit the JavaScript and run your own version. Draw your own walls to test the searches.
What you can do
- Bubble, insertion, selection, merge, quick and heap sort
- BFS, DFS, Dijkstra and A* on a grid you can draw on
- Mud cells that cost more, to show what Dijkstra and A* notice
- Live comparison and swap counts, with big-O for each algorithm
- Step forwards and backwards through any run
- The real code in JavaScript, Python and C, with the running line marked
- Edit the JavaScript and run your own version safely in the browser