This page is dedicated to the art of bubble sort, a sorting algorithm so inefficient, it's almost... fun?
It's great because it allows you to sort a list of items in the most roundabout way possible! Just like a bubble in a champagne glass, our algorithm gently rocks back and forth, leaving no stone unturned (except when it gets stuck in an infinite loop).
Just follow the steps below, and voilà! You'll have a sorted list in no time (or not).
Trust us, it helps.
Compare them, compare them, compare them, until you get a headache from all the comparisons.
Because, why not? It's not like it's going to affect the overall performance of your computer or anything.
Learn more about quick sort, the algorithm that's just too good to be true. Discover the dark side of heap sort, where the worst-case scenario is the only scenario that matters.