OurBigBook
.com (beta)
About
$ Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
32
)
Big O notation (
O
(
n
)
)
Module bound above, possibly multiplied by a constant:
f
(
x
)
=
O
(
g
(
x
)
)
(1)
is defined as:
∃
M
>
0
∃
x
0
∀
x
>
x
0
:
∣
f
(
x
)
∣
≤
M
g
(
x
)
(2)
E.g.:
∀
c
∈
R
x
+
c
=
O
(
x
)
. For
c
<
0
,
M
=
1
is enough. Otherwise, any
M
>
1
will do, the bottom line will always catch up to the top one eventually.
Ancestors
Big O notation family
Complexity class
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
Index
Incoming links
Big O notation family
Dense and sparse matrices
Little-o notation
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source