Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
Does anybody know about this and how to "Find the big-O notation of the following functions"?
a) 20n^3 + 10 n lg n + 5
What do you mean by, [red]find the big-O notation[/red]??
I was reading through my tutorial about big-O notation and what I understand is they use big-O notation to explain how complex the calculation (algorithm) can be with the huge numbers.
But... I can't relate to it to the above calculation. What (on earth!!) does it to do anything with it!!!?
Actually, this is NOT my assignment, so I have a solution here.
But I don't understand!
Since (n lg n) < n^2 < n^3,
OK... so algorithm of (n lg n) grows slower than algorithm of n^2 and n^3, I understand that's why they explain above I think.
f(n) = [20n^3 + 10 n lg n + 5] < [20n^3 + 10n^3 + 5n^3]
OK... I understand why it's [b]left < right[/b] but, WHY we have to compare like this?
= (20 + 10 + 50)n^3
Then, why does it conclude like, 35n^3 therefore O(n^3)??? Dont understand this conclusion....
If anybody understood what I wrote above, could you pls give me some advices??
0 · ·