Big-Omega term
lower bound on growth — best-case minimum
Says 'at least this expensive.' Used for proving an algorithm can't be faster than X, or for best-case analysis.
lower bound on growth — best-case minimum
Says 'at least this expensive.' Used for proving an algorithm can't be faster than X, or for best-case analysis.