Professional Documents
Culture Documents
Relationships
1.1
Transitivity
f (n)
f (n)
f (n)
f (n)
f (n)
1.2
= (g(n))
= O(g(n))
= (g(n))
= o(g(n))
= (g(n))
and
and
and
and
and
g(n)
g(n)
g(n)
g(n)
g(n)
f (n) =
f (n) =
f (n) =
f (n) =
f (n) =
(h(n))
O(h(n))
(h(n))
o(h(n))
(h(n))
=
=
=
(f (n))
O(f (n))
(f (n))
(g(n))
if and only if
g(n)
(f (n))
g(n)
g(n)
= (f (n))
= (f (n))
Transpose Symmetry
f (n)
f (n)
imply
imply
imply
imply
imply
Symmetry
f (n)
1.4
(h(n))
O(h(n))
(h(n))
o(h(n))
(h(n))
Reflexivity
f (n)
f (n)
f (n)
1.3
=
=
=
=
=
=
=
O(g(n))
o(g(n))
if and only if
if and only if
The following terms and rules should be familiar, as most will be a review of
some standard mathematical notations.
1
2.1
Monotonicity
2.2
The floor of x is the greatest integer less than or equal to x, and is denoted
by bxc. The ceiling of x is the least integer greater than or equal to x, and is
denoted by lceilxe.
For all real x: x 1 < bxc x dxe < x + 1.
2.3
Polynomials
n
X
ai n i
i=1
2.4
Exponentials
2.5
Logarithms
(binary logarithm)
(natural logarithm)
(exponentiation)
(composition)
2