Upper Bound
← Back to Big-O Notation
A function f(n) is O(g(n)) if f(n) grows no faster than g(n) for sufficiently large n. The upper bound provides a ceiling on growth rate, guaranteeing that the algorithm’s resource usage will not exceed this rate asymptotically.