Prove that if $f(n)$ and $g(n)$ are two non-negative functions,then $\max (f(n),g(n)) = \Theta (f(n)+g(n))$

by Ahmed Mousa   Last Updated October 14, 2018 19:20 PM

If $f(n)$ and $g(n)$ are two non-negative functions, then $\max (f(n),g(n)) = \Theta (f(n)+g(n))$

Tags : algorithms


Related Questions


Algorithm for Converting Rational Into Surreal Number

Updated November 09, 2017 04:20 AM

Complexity of subset-generation algorithm

Updated August 09, 2015 20:08 PM

Analysis for Karatsuba algorithm for multiplication

Updated September 14, 2017 15:20 PM

How to derive algorithm recurrence?

Updated October 10, 2017 02:20 AM

Approximate Factorization of a Natural Number

Updated November 21, 2017 21:20 PM