this post was submitted on 28 Mar 2025
609 points (99.0% liked)
Programmer Humor
22262 readers
97 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
- Keep content in english
- No advertisements
- Posts must be related to programming or programmer topics
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Wildly depends on the complexity of the feature. If it only takes 4 hours to implement, you might have good enough of an idea what needs to be done that you can estimate it with 1-hour-precision. That is, if you're only doing things that you've done in a similar form before.
If the feature takes two weeks to implement, there's so many steps involved in accomplishing that, that there's a high chance for one of the steps to explode in complexity. Then you might be working on it for six weeks.
But yeah, I also double any estimate that I'm feeling, because reality shows that that ends up being more accurate, since I likely won't have all complexity in mind, so in some sense my baseline assumed error is already 100%.
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)
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.