Doubt in algorithmic analysis

Asked

Viewed 79 times

6

I’m having a hard time proving f(n)=Omega(g(n)), then g(n) = O(f(n)).

How would this proof?
With calculation and theory?

1 answer

0


Browser other questions tagged

You are not signed in. Login or sign up in order to post.