27
Big-Oh Notation
Given functions f(
n
) and g(
n
), we say that
f(
n
) ∈
O
(g(
n
))
if there are positive constants
c
and
n
0
such that
f(
n
) ≤
c
·g(
n
) ∀
n
≥
n
0
Hence:
O(g(n))
is the set of all functions that do not grow faster than
g(n)
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}