a particular algorithm increases in time as the number of operations n increases. Suppose the time complexity of this algorithm is given by: f(n)=4n2+5n2*log(n) Show that f(n) is O(g(n)) for g(n) = n3
The Answer to the Question
is below this banner.
Here's the Solution to this Question
so f(n) is O(g(n))