quantum bogosort

Definitions

1. 1

   A hypothetical sorting algorithm which generates a random permutation of its input (like…

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

   • Implementing quantum bogosort increased my script's performance by 50%, but I still feel a little bit guilty about my computer killing quadrillions of sentient beings a second.
   • And from that we can conclude that in some parallel worlds, a machine to implement the Quantum Bogosort (theoretically the fastest possible sorting algorithm) has been invented.
   • Even quantum-bogosort can't keep up with Intelligent Design Sort. ¶ (IDS makes no changes to its input, on the theory that "they are already sorted according to a higher purpose.")

The neighborhood