Big-Omega Notation
← Back to Time Complexity
Asymptotic notation that describes the lower bound of an algorithm’s growth rate. Big-Omega provides a guarantee that the algorithm will take at least a certain amount of time.
Key Properties
Related
- Big-O Notation (upper bound)
- Big-Theta Notation (tight bound)