AI
AWS
Agile
Algorithms
Android
Apple
Backend
Bash
C++
Cloud
Csharp
Content
Quantum bogosort Quantum bogosort is a hypothetical sorting algorithm based on bogosort, created as an in- joke among computer scientists. The algorithm generates a random permutation of its input 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 holds, the use of this algorithm will result in at least one surviving universe where the input was successfully sorted in O(n) time.9
