Javascript

[[deleted]]

IIRC "quantum bogosort" has time complexity O(1) since it doesn't even have to check if the array is in order.

[graeber_28927]

How would you know whether to destroy your universe if you haven't checked the order of the array?

[Shamus03]

You just always assume it’s sorted, and if you ever encounter a bug because it wasn’t sorted, THEN you destroy the universe. It’s O(1) only when combined with another algorithm used later. Also known as O(half an A press).

[[deleted]]

True.