edited by
722 views

2 Answers

0 votes
0 votes

f(n)=Ω (n) => f(n)>=n

g(n)=O(n) => g(n)<=n

Now, for f(n) and g(n) we can say that f(n).g(n) is atleast n so Ω (n) 

and h(n)=Ѳ(n) => c1*n<=h(n)<=c2*n

so, f(n)*g(n)+h(n)= Ω (n) 

0 votes
0 votes

As f(n)=Ω (n) means f(n)>=n

g(n)=O(n) means g(n)<=n

lets understand with example if f(n)=n & g(n)= n then f(n).g(n)= n3

therefore f(n).g(n)>=n => Ω (n)

h(n)=Ѳ(n) 

f(n).g(n)+h(n)= max( [f(n).g(n)], h(n))  = Ω (n)