7 votes 7 votes Which of the following is true? a. h(n) is O(f(n)) b. h(n) is O(g(n)) c. g(n) is not O(f(n)) d. f(n) is O(g(n)) Why not answer c because both f(n) and g(n) have of same order so F(n)=θ g(n). Algorithms algorithms asymptotic-notation + – anshul namdeo asked Jun 6, 2016 • retagged Jun 26, 2022 by makhdoom ghaya anshul namdeo 12.8k views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments anshul namdeo commented Jun 7, 2016 reply Follow Share absolutely d is not correct.I think c is correct 0 votes 0 votes dd commented Jun 7, 2016 reply Follow Share Please check the expression of g(n) if it is the first one then option (d) is correct. $$g(n) = 2^{\sqrt{n}logn} \ \ \ \ \ g(n) = 2^{\sqrt{n}}*logn$$ 0 votes 0 votes anshul namdeo commented Jun 7, 2016 reply Follow Share it is the first one ,how d is correct plz explain 0 votes 0 votes Please log in or register to add a comment.
7 votes 7 votes $f(n) = 3*n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}*\log_{2} n} = n^{\sqrt{n}}$ So, f(n) and g(n) are of same order. Option (d) is correct. dd answered Jun 7, 2016 dd comment Share Follow See all 3 Comments See all 3 3 Comments reply asu commented Jun 7, 2016 reply Follow Share how gn=n^sqrt(n)g(n)=2n√∗log2n=nn 0 votes 0 votes dd commented Jun 7, 2016 reply Follow Share Simple log formula : $A^{\log_{k}B} = B^{\log_{k}A} \\$ 1 votes 1 votes asu commented Jun 8, 2016 reply Follow Share thats true.. and see i also evaluated f(n) =g(n)....he asked the question with different functions but later he modified.....modify the question 0 votes 0 votes Please log in or register to add a comment.
4 votes 4 votes Ans - D Source: https://www.youtube.com/watch?v=q24qQnX1Pts John Ajith A answered Apr 21, 2018 John Ajith A comment Share Follow See all 0 reply Please log in or register to add a comment.