743
Not my problem sort (infosec.pub)
you are viewing a single comment's thread
view the rest of the comments
[-] BatmanAoD@programming.dev 147 points 2 years ago

Reminds me of quantum-bogosort: randomize the list; check if it is sorted. If it is, you're done; otherwise, destroy this universe.

[-] xmunk@sh.itjust.works 96 points 2 years ago

Guaranteed to sort the list in nearly instantaneous time and with absolutely no downsides that are capable of objecting.

[-] frezik@midwest.social 48 points 2 years ago

You still have to check that it's sorted, which is O(n).

We'll also assume that destroying the universe takes constant time.

[-] BatmanAoD@programming.dev 44 points 2 years ago

In the universe where the list is sorted, it doesn't actually matter how long the destruction takes!

[-] groet@feddit.org 13 points 2 years ago

It actually takes a few trillion years but its fine because we just stop considering the "failed" universes because they will be gone soon™ anyway.

[-] MBM@lemmings.world 9 points 2 years ago

Eh, trillion is a constant

[-] FiskFisk33@startrek.website 7 points 2 years ago

amortized O(0)

load more comments (3 replies)
load more comments (6 replies)
load more comments (16 replies)
this post was submitted on 08 Nov 2024
743 points (98.2% liked)

Programmer Humor

33743 readers
2241 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 3 years ago
MODERATORS