Big-O Notation
← Back to Time Complexity
Asymptotic notation that describes the upper bound of an algorithm’s growth rate. Big-O captures worst-case behavior, providing a guarantee that the algorithm will not exceed a certain growth rate.
Key Properties
Related
- Big-Omega Notation (lower bound)
- Big-Theta Notation (tight bound)