in Algorithms retagged by
689 views
0 votes
0 votes

in Algorithms retagged by
689 views

2 Comments

How B ? It should be A .
$\Omega (n) +\Theta (n) = \Omega (n)$

I think this should be the actual question
https://gateoverflow.in/11232/let-f-n-%CF%89-n-g-n-o-n-and-h-n-%D1%B3-n

1
1
@PC Boss it's different question. Please read it again.
0
0

1 Answer

0 votes
0 votes
We don't know the upper bound of h(n). Therefore nothing can be said about upper bound of given expression.Also lower bound of f(n) & g(n) are n.

f(n).g(n) = $\Omega{(n^{2})}$

And, h(n) = $\Omega{(n)}$ ,

Therefore expression would give $\Omega{(n^{2})}$

2 Comments

how can u write f(n).g(n)=$\Omega (n^{2})$
0
0
Considering only lower bound.
0
0