The conversation between human and AI assistant.
How do I show that f(n) +g(n) = O(max(f(n),g(n)))?
Interesting. How do we proceed from there?
Let's denote g(n)/f(n) by k. Then we can rewrite the inequality as 1+k <= c, which implies that c>=1+k.