Zitat Zitat von nudelsalat Beitrag anzeigen
Quantum bogosort! \o/
Zitat Zitat
Wikipedia: An in-joke among some computer scientists is that quantum computing could be used to effectively implement a bogosort with a time complexity of O(n). It uses true quantum randomness to randomly permute the list. The list is then inspected, and if it is not in order, the universe is destroyed.


Aber Sleepsort ist auch Spitze! Kannte ich allerdings schon …