ƒ
ΦΓ
mμlα
ω
θ
η
Home
Formulae
Time & Calendar
Health & Fitness
Physics Laws
Currency
Converters
Reference
Notepad
Mavericks
Search Results
1 result for “big-o”
Formulae (1)
Computer Science
Intermediate
Common Time Complexities
O
(
1
)
<
O
(
log
n
)
<
O
(
n
)
<
O
(
n
log
n
)
<
O
(
n
2
)
<
O
(
2
n
)
O(1) < O(\log n) < O(n) < O(n\log n) < O(n^2) < O(2^n)
O
(
1
)
<
O
(
lo
g
n
)
<
O
(
n
)
<
O
(
n
lo
g
n
)
<
O
(
n
2
)
<
O
(
2
n
)
Ordering of common algorithmic growth rates.