608
you are viewing a single comment's thread
view the rest of the comments
[-] CanadaPlus@lemmy.sdf.org 1 points 5 days ago* (last edited 5 days ago)

Hmm, so kinda O(n^1.5^) scaling? (Of the ratio between definitely required time and possibly required time, anyway, since a -110% error wouldn't make sense)

[-] Ephera@lemmy.ml 2 points 4 days ago

Really not sure an estimate for algorithmic complexity is the right way to specify this. ๐Ÿ˜…
But if your supposed input unit is days, then I guess, yeah, that kind of works out.

this post was submitted on 28 Mar 2025
608 points (99.0% liked)

Programmer Humor

22189 readers
1554 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