The conversation between human and AI assistant.
How do I show that f(n) +g(n) = O(max(f(n),g(n)))?
Ok, that makes sense. How do I go about finding those constants?
First, we can assume without loss of generality that f(n)>=g(n). Then we can rewrite the inequality as (f(n)+g(n))/f(n) <= c. We can simplify this as 1+g(n)/f(n) <= c.