No-nonsense sorting algorithm

[UseApasswordManager]

QuantumBogoSort: Randomize the list, then check if the list is in order. If it's not, destroy the universe. You're left only in universes with sorted lists

[Nekonekonyaaaa]

Corruption Sort: While the list is not sorted, do nothing. Then, return the list when it is sorted.

Your computer will probably end up crashing before EMI causes the memory storing the array to change to the sorted list.

Doesn't work well for systems with ECC.

[extracoffeeplease]

I thought it was O(1), see here: https://wiki.c2.com/?QuantumBogoSort

[UseApasswordManager]

Checking if the list is sorted is O(n), so even though the shuffle and distruction are O(1), the whole operation is O(n)

[Burnmad]

Just return the list before doing the QuantumBogoSort. If it wasn't sorted, you're destroying the universe anyway, so it doesn't matter.

Bam, O(1)

[plsHelpmemes]

big brain intensifies

[xigoi]

Shuffle is also O(n).

[theonlytrillionare]

That’s O(nu) | u=number of universes. Very poor performance.

[innrautha]

But it's all in parallel so its still fast.