352 views

1 Answer

1 votes
1 votes
$f(n)=O(g(n))\Rightarrow f(n)=c \times g(n) \text{for some constant c}$

$\Rightarrow \frac{1}{c}\times f(n)\leq g(n)\Rightarrow g(n)=\Omega (f(n))$
edited by

Related questions

1 votes
1 votes
2 answers
1
nbhatt asked Nov 3, 2022
372 views
Is ln(n!)=theta(n ln(n))?
0 votes
0 votes
1 answer
2
nbhatt asked Nov 3, 2022
276 views
If big oh is possible for an algorithm but big Omega is not,then is it small o?
1 votes
1 votes
1 answer
4
AIkiran01 asked Jul 14, 2018
1,876 views
which of the following estimates are true? Explain with valid reasons.a) (2n)! is theta (n)!b) log((2n)!) is theta (log(n)!)