0 votes 0 votes If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ? Algorithms algorithms asymptotic-notation + – Ashwani Kumar 2 asked Jul 6, 2016 edited Jun 26, 2022 by makhdoom ghaya Ashwani Kumar 2 722 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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) gshivam63 answered Jul 6, 2016 gshivam63 comment Share Follow See all 0 reply Please log in or register to add a comment.
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)=n2 & 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) Anjali_aspirant answered Jul 6, 2016 Anjali_aspirant comment Share Follow See all 0 reply Please log in or register to add a comment.