title: Prove f(n) + g(n) is O(max(f(n),g(n)))
body: <p>Hello I am having a bit of difficulty proving the following.</p>
  
  <pre><code>f(n) + g(n) is O(max(f(n),g(n)))
  </code></pre>
  
  <p>This makes logical sense, and by looking at this I can tell you that its correct but I'm having trouble coming up with a proof.</p>
  
  <p>Here is what I have so far:</p>
  
  <pre><code>c * (max(f(n),g(n))) &gt; f(n) + g(n) for n &gt; N
  </code></pre>
  
  <p>But I'm not sure how to pick a c and N to fit the definition because I don't know what f(n) and g(n) are.</p>
  
  <p>Any help is appreciated.</p>