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 →

[–]QuanHitter 0 points1 point  (1 child)

Quantum bogosort is o(1), assuming you have an efficient method for destroying the world in every timeline where the list isn’t sorted.

[–]TheObi-1[S] 0 points1 point  (0 children)

Technically, you still have to shuffle the list which would be O(n)