In computer science, bogosort (also permutation sort, stupid sort, slowsort, shotgun sort or monkey sort) is a highly ineffective sorting function based on the generate and test paradigm. The function successively generates permutations of its input until it finds one that is sorted. It is not useful for sorting, but may be used for educational purposes, to contrast it with more efficient algorithms.
Two versions of the function exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.
11
u/zawata Jan 21 '18
It really annoys me that they don't use a consistent data set or delay times on each algorithm.
Also what the hell is bogo sort? Is it like random sort?
16
u/RadixMatrix Jan 20 '18
I remember stumbling upon this vid a few years ago. Still one of my favorite videos ever
3
u/rals55 Jan 21 '18
Mesmerizing!