# Order of Complexity Proof

Prove:

f(n) + g(n) = θ(f(n)) if g(n) = o(f(n))

© BrainMass Inc. brainmass.com October 9, 2019, 4:25 pm ad1c9bdddfhttps://brainmass.com/computer-science/data/order-complexity-proof-31962

#### Solution Preview

Because,

g( n ) = O( f(n) ) => there are values, n0 and c: g( n ) ≤ c * f( n ) whenever n ≥ n0

Because

f(n) +g(n) = theta (f(n)) => ...

#### Solution Summary

Order of Complexity Proof is demonstrated.

$2.19