the wackiest, pessimal of algorithms that you won't ever need
To sort a list, just shuffle it till entropy finds its way to order. Wikipedia says, "Its name is a portmanteau of the words bogus and sort".
[ View Source ] [ Description ]
Also known as "Assumption Sort": Assume the list is sorted, return! The probability of the original input list being in the exact order it's in is 1/(n!). There is such a small likelihood of this that it's clearly absurd to say that this happened by chance, so it must have been consciously put in that order by an intelligent Sorter. Therefore it's safe to assume that it's already optimally Sorted in some way that transcends our naïve mortal understanding of "ascending order". Any attempt to change that order to conform to our own preconceptions would actually make it less sorted.
[ View Source ] [ Description ]
To sort a list, it spawns a coroutine for each element that sleeps for the element's value, in seconds (times a multiplier for reducing wait time). The order the coroutines print in will be in sorted order, almost always™.
[ View Source ] [ Description ]
Sayan Goswami (@say4n)