Which asymptotic notation represents the lower bound of an algorithm’s growth rate?
Options
- A. Big-O
- B. Big-Ω
- C. Big-Θ
- D. More than one of the above
- E. None of the above
Quiz Practice:
B. Big-Ω
Big-Ω (Omega) notation represents an asymptotic lower bound. It indicates that a function grows at least as fast as the specified bound, up to a constant factor, for sufficiently large input sizes. In algorithm analysis, Ω can describe a lower bound on running time or another resource. Remember the common distinction: O = upper bound, Ω = lower bound, Θ = tight bound.