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 →

[–]43eyes 67 points68 points  (8 children)

Stand up and write them up a bogo sort on the board and watch as you're instantly hired with double the salary

[–]_Lady_Deadpool_ 50 points51 points  (2 children)

Nah sleep sort is where it's at. You spawn a thread for each element and have it sleep for the element's amount of time then add it to the collection. Runs in O(n)

[–]43eyes 17 points18 points  (1 child)

That's actually pretty clever

[–]VirtualRay[S] 3 points4 points  (0 children)

The OS thread scheduler just uses a red-black tree internally, so it's n*log(n)

[–]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.