this post was submitted on 11 Oct 2025
435 points (99.5% liked)

Programmer Humor

28513 readers
1591 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 2 years ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev
435
Who cares about time complexity (lemmy.world)
submitted 3 months ago by qaz@lemmy.world to c/programmer_humor@programming.dev
60 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] TheLazyNerd@europe.pub 16 points 3 months ago

Since Roman numerals have an upper bound, the time complexity is always O(1).