0

for every C>0 where C is constant we need to prove that:

O(f(n)) + C = O(f(n) + C) = O(f(n))

I am new to Big-Oh Notation and I would use any hint or guide how to deal with such things.

BMW BOI
  • 23
  • 1
    $f(n)$ at least be no smaller than a constant to get your result... – JetfiRex Feb 23 '22 at 01:04
  • As always, the place to begin is with the definition of big O notation. Study it and consider how it applies to this problem. As JetfiRex says, your statement is only true for some functions $f(n)$. If $f(n)$ is asymptotically constant or growing, then it is true. But if $f(n)$ is asymptotically shrinking, then $O(f(n) + C) = O(C)$ instead. – Paul Sinclair Feb 23 '22 at 16:34

0 Answers0