this post was submitted on 08 Nov 2024
675 points (98.3% liked)

Programmer Humor

19497 readers
1305 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
 
you are viewing a single comment's thread
view the rest of the comments
[–] xmunk@sh.itjust.works 86 points 23 hours ago (3 children)

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

[–] frezik@midwest.social 45 points 23 hours ago (2 children)

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 40 points 22 hours ago (2 children)

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

[–] groet@feddit.org 11 points 18 hours ago (1 children)

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 7 points 15 hours ago

Eh, trillion is a constant

[–] FiskFisk33@startrek.website 8 points 21 hours ago

amortized O(0)

[–] Benjaben@lemmy.world 8 points 18 hours ago (1 children)

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

Well yeah just delete the pointer to it!

[–] PoolloverNathan@programming.dev 2 points 9 hours ago

universe.take()

[–] vithigar@lemmy.ca 14 points 23 hours ago (1 children)

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 22 hours ago

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