Finding Worst Case complexity of the function 4n log n+7n

Question

I am having a hard time trying to solve this one particular Big Oh problem:

4n log n+7n=O(n log n)

I have tried by applying n>=1, but nothing's coming out of it and the only hint is that 4n log n dominates 7n.

Check Wikipedia and find the mathematical definition of what Big-O of a function (IE: `O(f(n))`) actually means. The definition will yield the answer. — Ironcache, Feb 02 '18 at 18:00

score 0 · Accepted Answer · answered Feb 02 '18 at 16:55

0

You can use the below approach:

4n log n + 7n <= 4n log n + 7n log n ; for all n>=2
              <= 11n log n
              = O(n log n).

Hence, you can say that n log n dominates in this function, and the worst complexity comes out to be O(n log n).

answered Feb 02 '18 at 16:55

Am_I_Helpful

1 Answers1