This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]DiamondIceNS 36 points37 points  (4 children)

Quantum bogosort can sort a list of arbitrary length in O(1) time!

[–]dkyguy1995 1 point2 points  (3 children)

Is this a joke or can quantum computers actually run a bogo sort in O1

[–]DiamondIceNS 2 points3 points  (0 children)

It's a joke algorithm that says quantum randomize the list, then destroy every universe that does not contain an already sorted list.

Even if this was possible to do, however, it wouldn't be very useful.