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
Post a Comment