Summary

Landau notation describes asymptotic_growth of functions as n increases. big_o is an asymptotic upper_bound. big_omega is a lower_bound. big_theta is a tight_bound. little_o means strictly smaller order. little_omega means strictly larger order. Constant factors and lower order terms are ignored, noted as constants_ignored. Read f(n) in terms of g(n) for large n. Common classes include 1, log n, n, n log n, n^2. Landau notation summarizes algorithmic growth succinctly.