How to justify $f(n) = O(g(n))$

Asked Sep 11 '19 at 18:35

Active Sep 13 '19 at 16:24

Viewed 75 times

The following question is in my homework:

Is the statement $f(n) = O(g(n))$ true, when $f(n) = n/2 + 4$ and $g(n) = \sqrt{n} + 2\log_2 n + 3$?

I understand how $f(n)$ is the upper bound of $g(n)$. However, I am unsure how to prove it mathematically.

edited Sep 12 '19 at 07:29

Yuval Filmus

asked Sep 11 '19 at 18:35

DanielJomaa

2

When all else fails, use the definitions. – Yuval Filmus Sep 11 '19 at 19:02
What is big O? – vladimir Sep 12 '19 at 06:00
1

See https://cs.stackexchange.com/a/827/683. – Yuval Filmus Sep 12 '19 at 07:28

0 Answers0