0 votes 0 votes f(n)=o(g(n)) if and only if a) g(n)=Ω(f(n)) b) g(n)=ω(f(n)) c)g(n)=Ω(f(n)) and g(n)=ω(f(n)) Algorithms algorithms asymptotic-notation + – Prerna Chauhan asked Oct 18, 2016 retagged Jun 21, 2022 by makhdoom ghaya Prerna Chauhan 1.4k views answer comment Share Follow See 1 comment See all 1 1 comment reply Prashant. commented Oct 18, 2016 reply Follow Share It will be g(n)=ω(f(n)) 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes $f(n) = o(g(n))$ i.e $f(n)<cg(n)$ or $g(n)>cf(n)$ i.e $g(n) = \omega(f(n))$, so b) is the answer vivek9837 answered Oct 18, 2016 selected Oct 18, 2016 by Arjun vivek9837 comment Share Follow See all 2 Comments See all 2 2 Comments reply Prerna Chauhan commented Oct 19, 2016 reply Follow Share What about option c? 0 votes 0 votes Yashvir commented Feb 24, 2021 reply Follow Share f(n)=o(g(n)) => f(n) < g(n) strictly not equal g(n) > f(n) according to Transpose Property So g(n)=ω(n) Also g(n) is not Ώ(n) as g(n)!=f(n) Option b is the answer. 0 votes 0 votes Please log in or register to add a comment.