1
Fork 0
mirror of https://github.com/Steffo99/appunti-magistrali.git synced 2024-11-24 03:04:18 +00:00
appunti-steffo/9 - Algoritmi distribuiti/1 - Problemi algoritmici/notazione O-grande.md

26 lines
548 B
Markdown

---
aliases:
- big-O
---
[[notazione asintotica]] per il [[limite inferiore]].
$$
\def \varAsym {{\color{royalblue} g(n)}}
\def \varFunc {{\color{orangered} f(n)}}
\def \varMore {{\color{palegreen} c_{more}}}
\def \varBeginning {{\color{turquoise} n_0}}
\Huge
O(\varAsym)
$$
In linguaggio formale, $\varFunc$ è in $O(\varAsym)$ se:
$$
O(\varAsym)
\Longleftrightarrow
\begin{cases}
\exists & \varMore > 0\\
\exists & \varBeginning > 0\\
\\
\forall & n \geq \varBeginning\\
: & 0 \leq \varFunc \leq (\varMore \cdot \varAsym)
\end{cases}
$$