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

Programmer Humor

19149 readers
982 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
[email protected]
[email protected]
[email protected]
403
Not everything can be done in constant time, that's O(k) (sh.itjust.works)
submitted 2 months ago by [email protected] to c/[email protected]
41 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 6 points 2 months ago (2 children)

Maybe finding the (n!)²th prime?

[–] [email protected] 1 points 2 months ago

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

[–] [email protected] 1 points 2 months ago

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