15 sorting algorithms in 6 minutes

A funny explanation of the bogo was in the Wikipedia article for it

Imagine you have a deck of cards, you check if its ordered and if it isn't you simply throw all the cards in the air and then check again until its ordered.

also: dat quantum bogosort:

Quantum Bogosort
An in-joke among some computer scientists is that quantum computing could be used to effectively implement a bogosort with a time complexity of O(n).[8] It uses true quantum randomness to randomly permute the list. The list is then inspected, and if it is not in order, the universe is destroyed. By the many-worlds interpretation of quantum physics, the quantum randomization spawns 2^N (where N is the number of random bits) universes and one of these will be such that this single shuffle had produced the list in sorted order.