I have got a function and want to denote it in terms of bigO notation.
f(n) = log4n+n*(1/3). Is this function O(n)? (* here is the multiplication) Thanks for your help
I have got a function and want to denote it in terms of bigO notation.
f(n) = log4n+n*(1/3). Is this function O(n)? (* here is the multiplication) Thanks for your help
In the context of computational complexity, we want to describe the behaviour of $f(n)$ as $n\rightarrow \infty$. $\frac{\log 4n }{n}\rightarrow 0$ as $n\rightarrow \infty$ so $f(n)/n\rightarrow 1/3$ so surely for $n$ large, $f(n)/n<\alpha $ for some constant $\alpha>1/3$. So by definition, $f(n)=O(n)$.