quantum bogosort

Noun

 * 1)  A hypothetical sorting algorithm which generates a random permutation of its input (like in bogosort) using a quantum source of entropy, checks if the list is sorted, and, if it is not, destroys the universe. Assuming that the many-worlds interpretation of quantum mechanics is true, this algorithm will result in at least one surviving universe where the input was successfully sorted in $$O(n)$$ time (thus making it faster than quicksort).

Usage notes

 * Quantum bogosort is an in-joke among computer scientists, and is one of many humorous or nonsensical sorting algorithms.