Bubble Sort Visualisation

Bubble Sort Visualisation

I made this code because I like sorting algorithms, and I find it very satisfying to watch all of it happen.

How does it work

Bubble Sort is actually very inefficient, but is used a lot as example for sorting algorithms because of its easy explanation. It works as follows: the algorithm compares the first item to the second. If the first one is greater, it swaps places. Then it compares the second and third element, then the third and fourth... you get the idea.

After the first iteration, the last one can be ignored since it is the biggest number, no matter what. So the second time you loop trough the items, you loop through all the items, except the last one. This continues until all items are sorted!

The Visualisation