Summary

Use big_theta_notation to state an asymptotic_tight_bound on an algorithm's growth_rate. If g(n) is Θ(f(n)), then for some positive constants_c1_c2 and an n0_threshold, c1 f(n) ≤ g(n) ≤ c2 f(n) for all n ≥ n0. This gives matching upper_and_lower_bounds, capturing the exact order of growth. Remember: Θ ignores constant factors and lower-order terms. Example: n^2 + 3n is Θ(n^2). Use Θ to summarize running time when you know the tight bound.