744
Not my problem sort (infosec.pub)
you are viewing a single comment's thread
view the rest of the comments
[-] xmunk@sh.itjust.works 95 points 6 days 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 6 days 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 43 points 6 days ago

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

[-] groet@feddit.org 13 points 5 days 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 8 points 5 days ago

Eh, trillion is a constant

[-] FiskFisk33@startrek.website 8 points 6 days ago

amortized O(0)

[-] Benjaben@lemmy.world 9 points 5 days ago

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

Well yeah just delete the pointer to it!

[-] PoolloverNathan@programming.dev 2 points 5 days ago

universe.take()

[-] vithigar@lemmy.ca 16 points 6 days ago

Except you missed a bug in the "check if it's sorted" code and it ends up destroying every universe.

[-] db2@lemmy.world 7 points 6 days ago

There's a bug in it now, that's why we're still here.

[-] frezik@midwest.social 1 points 6 days 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.

this post was submitted on 08 Nov 2024
744 points (98.2% liked)

Programmer Humor

19551 readers
1020 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 1 year ago
MODERATORS