Hacker News Reader

Here are two other visualizations:

https://www.youtube.com/watch?v=8raee-rvBw0

https://www.youtube.com/watch?v=bydMm4cJDeU

The visualization helped me realize something: The index doesn't change after the swap, so you always end up with the biggest number "in hand" after a full deeper level iteration loop.

very beautiful simple animation. Good visualization of the proof of the algo; namely, that at each step i of the outer loop the first i elements are sorted (this is easy to show via induction)

This looks like a cool progress bar.

That's a neat idea!

Add bubble sort in parallel and race them against each other!

Here you go: https://jsfiddle.net/790sfL21/30/

The difference between the two algorithms becomes even more apparent if you rerun the sort after the list is already sorted.

"Slower than bubblesort" is the acheivement here.

Thank you for this!