4 votes 4 votes Assume that f(n) and g(n) are two functions, such that f(n)=O(g(n)). Which of the following always hold? A)$f(n)=O((f(n))^{2})$ B)$f(n)=\Omega ((f(n))^{2})$ C)$g(n)=O ((f(n))^{2})$ D)$g(n)=\Omega (g(n))$ Algorithms time-complexity algorithms asymptotic-notation + – srestha asked Nov 10, 2017 srestha 1.1k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Anu007 commented Nov 10, 2017 reply Follow Share Take f(n) = 1/n this will eleminate option (a). and f(n) = n this will eleminate option (b) and f(n) = n and g(n) = n4 will eliminate (c) option D always true. 3 votes 3 votes $ruthi commented Nov 12, 2017 reply Follow Share i didn't get u. Can u plz elloborate it for option a 0 votes 0 votes Mk Utkarsh commented Dec 29, 2017 reply Follow Share @$ruthi problem with option A is when f(n) = 1/n then it cannot be O(f(n^2)) because square of 1/n will always be larger than 1/n for example: f(n) = n f(1/2) = 1/2 f(1/4) = 1/4 f(1/2) = O(f(n^2)) 1/2 = O(1/4) // this does not hold 0 votes 0 votes Please log in or register to add a comment.