quantum bogosort

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).