• 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
      ·
      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.