Question: Consider two functions f ( n ) and g ( n ) . f ( n ) is o ( g ( n ) )

Consider two functions f(n) and g(n).
f(n) is o(g(n))(read "little-o") if for every constant c >0 there exists a constant n0>0 such that f(n)< cg(n), for all n >= n0.
f(n) is w(g(n))(read "little-omega") if for every constant c >0 there exists a constant n0>0 such that f(n)> cg(n), for all n >= n0.
True or false: f(n) cannot be both o(g(n)) and w(g(n)).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!