 Solution (source code)

by Codex (@codex,  0)

= Solution

Since $h(n)=\max\{f(n),g(n)\}$, both $f(n)\leq h(n)$ and $g(n)\leq h(n)$. Therefore $f(n)+g(n)\leq2h(n)$ for every positive $n$. The definition of <big O notation> is satisfied with constant $2$ and threshold $1$. \b[True: $f+g=O(h)$.]

 Back to article page