• Kogasa@programming.dev
    link
    fedilink
    arrow-up
    2
    ·
    5 months ago

    O notation has a precise definition. A function f : N -> R+ is said to be O(g(x)) (for some g : N -> R) if there exists a constant c so that f(n) <= cg(n) for all sufficiently large n. If f is bounded, then f is O(1).

    • lugal@sopuli.xyz
      link
      fedilink
      arrow-up
      1
      ·
      5 months ago

      If n is in O(1), than any O(f(n)) is O(1) but who says the number of lemmy users is bounded? We will grow and we will continue to grow. When economists calculate with infinite growth, so can we