this post was submitted on 22 Jun 2024
404 points (97.4% liked)

Programmer Humor

19291 readers
1247 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
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev
404
Not everything can be done in constant time, that's O(k) (sh.itjust.works)
submitted 3 months ago by alphacyberranger@sh.itjust.works to c/programmer_humor@programming.dev
41 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] suzune@ani.social 6 points 3 months ago (2 children)

Maybe finding the (n!)²th prime?

[–] MinekPo1@lemmygrad.ml 1 points 3 months ago

this would assume that finding the next prime is a linear operation , which is false

[–] victorz@lemmy.world 1 points 3 months ago

I guess, yeah, that'll do it. Although that'd probably be yet one or a few extra factors involving n.