2 votes 2 votes closed as a duplicate of: Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n). Let f(n)=O(n),g(n)=O(n) and h(n)=Ѳ(n). Then [f(n).g(n)]+h(n) is: Ω (n) O (n) Ѳ (n) None of these Algorithms asymptotic-notation + – VS asked Jan 3, 2018 • closed Jan 3, 2018 by Arjun VS 287 views comment Share Follow See 1 comment See all 1 1 comment reply VS commented Jan 3, 2018 reply Follow Share Sir , here f(n)=O(n) .. a bit different I was having doubt thats why posted as separate question. 1 votes 1 votes Please log in or register to add a comment.