I made an only sorting algo visualizer which runs same algo on many randomly sorted arrays at the same time. The swap call which actually does the sorting also does the drawing. You could draw whole array or just one swap.

It looks very cool on large arrays.

https://xosh.org/VisualizingSorts/sorting.html

https://xosh.org/sorting-algorithms-visual-comparison/

This is pretty neat. you should add sound effects like this - https://www.youtube.com/watch?v=kPRA0W1kECg

Love it. I also built a platform that works for any algorithm and problem based on call stack tracing. Works best for recursion, backtracking and dynamic programming problems. https://www.onenoughtone.com/visualizers

Love it, thank you for this. The last one 'Shortest Unsorted Continuous Subarray' produced some errors: 'Cannot set properties of undefined (setting 'selected')

Very cool... wanted to check out the source but the only clue I could find to a source repo (the "Fork" button) does not work.

The fork button in bottom left corner goes to a repo on GitHub https://github.com/algorithm-visualizer/algorithm-visualizer

At National University of Singapore, we use https://visualgo.net/en/sorting?slide=12-1. It was developed by Prof. Stephen Halim.

Very cool. One of my favorite professors in college would make 100+ slide powerpoints of algorithms and flip through them really fast in order to visualize what they were doing, it was really helpful.

I love it. Work like this does a great service to humanity.

Good luck with the project, especially in this day and age.

Not sure if the author might be here, but I'm just wondering if it might have take inspiration from old CS Academemy lessons. I worked on those, and recognize some UI ideosincracies that bring up nostalgia, like for https://csacademy.com/lesson/breadth_first_search

visual leearning