Ciro Santilli
OurBigBook.com
$£
Sponsor
中国
独裁统治 China Dictatorship 新疆改造中心、六四事件、法轮功、郝海东、709大抓捕、2015巴拿马文件 邓家贵、低端人口、西藏骚乱
Big O notation
(
O
(
n
)
)
...
Information technology
Computer
Computer science
Computational problem
Complexity class
Big O notation family
OurBigBook.com
words: 69
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
(9)
Big O notation family
Complexity class
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
Home
Incoming links
(3)
Big O notation family
Dense and sparse matrices
Little-o notation