## Big Oh Notation

Big Oh notation describes the limiting behavior of a function $$f(n)$$ when its argument approaches infinity. Let $$f,g$$ be two functions on positive numbers. We write $$f = O(g)$$ if there exists $$c>0$$ such that $$f(n)\leq c \cdot g(n)$$ for

Tagged with:
Posted in Algorithm, Theory