Hey guys, I have this ex in Data structure course.
This ex is about big o notation, and as far I remember It means that $f_1$ and $f_2$ bound asymptotically $g_1, g_2,$ but i'm not quite sure.
The question: $f_1(n)=O(g_1(n)), f_2(n)=O(g_2(n))$ Two functions are from and to the natural numbers.
I need to prove: $f_1(n)+f_2(n) = O(\max\{g_1(n),g_2(n)\})$
Thank you for the help.