Big-Theta Notation
← Back to Time Complexity
Asymptotic notation that describes the tight bound of an algorithm’s growth rate. When Big-O and Big-Omega match, Big-Theta precisely characterizes the algorithm’s asymptotic behavior.
Key Properties
Related
- Big-O Notation (upper bound)
- Big-Omega Notation (lower bound)