Quantum Bogosort Algorithm
⌃ 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]
A mock encyclopedia entry describes “quantum bogosort,” a deliberately absurd sorting algorithm. It randomly shuffles data and destroys the universe whenever the result is unsorted, but the many-worlds interpretation supposedly guarantees one universe where sorting succeeds in linear time. The meme is used as a nerdy reaction to quantum computing, inefficient algorithms, or wildly overcomplicated solutions.
encyclopedia-style article / статья в стиле энциклопедииquantum sorting algorithm / квантовый алгоритм сортировкиcomputer science text / текст о компьютерных наукахpencil edit icon / значок карандаша для редактированияmathematical notation O(n) / математическая запись O(n)hyperlink text / текст гиперссылкиwhite page / белая страницаblack typography / чёрная типографика
- @dev_meme / 5466 2023-09-16
- Template
- Quantum bogosort
- Type
- image
- Size
- 800×719 · 105.2 KiB
- Mood
- absurd, nerdy
- Language
- en
- Added