$\max(f(n), g(n)) = O(f(n) + g(n))$
How do I prove this? Also I'd appreciate the markup being corrected, thanks.
You can use $\max(f(n),g(n)) \leq f(n) + g(n)$, given that both functions are non-negative.
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
By posting your answer, you agree to the
terms of service.
2 years ago