• uis@lemm.ee
    link
    fedilink
    arrow-up
    1
    ·
    8 months ago

    Basically you can say that time it takes never goes above grapf of some function scaled by constant.

    Fun side effect of this is that you can call your O(1) algorithm is O(n!) algorithm and be technically correct.