Bubblesort Theory: The Ultimate Guide (in Theory)

Warning: this is not for the faint of heart. Bubblesort is the most inefficient, most convoluted, and most utterly fascinating algorithm you'll ever have the displeasure of encountering. But hey, at least it's fun to talk about, right?

Also known as the "Dance of the Bubbling Bunch of Sorts", Bubblesort is a sorting algorithm so slow, it'll make you wonder why you ever bothered. But don't worry, we'll get through this together, with a healthy dose of sarcasm and a pinch of despair.

Here's the basic idea: start by taking your unsorted array, and then repeatedly find the smallest element, swap it with the first element, and then... and then... Ugh, who cares? Just go read the Wikipedia article, it's not like I'm gonna explain it any better.