big o - Prove max(O(f(n)), O(g(n)))=O(max(f(n), g(n)) -


prove max(o(f(n)), o(g(n)))=o(max(f(n), g(n)) 

it make sense, far don't have idea how prove it.

any input appreciated.

f(n) <= max(f(n), g(n)) g(n) <= max(f(n), g(n))  max(o(f(n)), o(g(n))) <= o(max(f(n), g(n)), max(f(n), g(n))) = o(max(f(n), g(n))) 

note in-equalities used not strict.


Comments

Popular posts from this blog

linux - Does gcc have any options to add version info in ELF binary file? -

android - send complex objects as post php java -

charts - What graph/dashboard product is facebook using in Dashboard: PUE & WUE -