Algorithms Analysis Big O notation -


i need in question. don't understand how it.

show, either mathematically or example, if f(n) o(g(n)), a*f(n) o(g(n)), constant > 0.

i'll give this. should in right direction:

definition of o(n):

a function f(n) satisfies f(n) <= c*n arbitrary constant number c , every n above arbitrary constant number n noted f(n) = o(n).

this formal definition big-o notation, should simple take , turn solution.


Comments

Popular posts from this blog

objective c - Change font of selected text in UITextView -

php - Accessing POST data in Facebook cavas app -

c# - Getting control value when switching a view as part of a multiview -