• Ephera@lemmy.ml
    link
    fedilink
    English
    arrow-up
    3
    ·
    4 days ago

    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%.

    • CanadaPlus@lemmy.sdf.org
      link
      fedilink
      arrow-up
      1
      ·
      edit-2
      4 days ago

      Hmm, so kinda O(n1.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
        link
        fedilink
        English
        arrow-up
        2
        ·
        3 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.