2 votes 2 votes Algorithms algorithms asymptotic-notation test-series + – dragonball asked Oct 15, 2017 • retagged Jul 13, 2022 by makhdoom ghaya dragonball 936 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply sourav. commented Oct 15, 2017 reply Follow Share $(A)?$ 0 votes 0 votes dragonball commented Oct 15, 2017 reply Follow Share Plz explain with solution . 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes $f(n)=n^{\frac{1}{\sqrt{\log n}}}= e^{\log n^{\frac{1}{\sqrt{\log n}}}}=e^{\sqrt{\log n}}$ $g(n)=\sqrt{\log n}=e^{\log \sqrt{\log n}}$ $h(n)=n^{\frac{1}{100}}=e^{\log n^{\frac{1}{100}} }=e^{k \times \log n}$ $g(n)\, < \,f(n) \, <h(n)$ sourav. answered Oct 15, 2017 • selected Oct 15, 2017 by dragonball sourav. comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments dragonball commented Oct 15, 2017 reply Follow Share Thank u :) 0 votes 0 votes rajatmyname commented Apr 15, 2018 reply Follow Share But I think if you compare f(n) and h(n), f(n) is greater because it will have 1/(logn)^1/2 term whereas h(n) will contain a constant term 1/100 0 votes 0 votes Ashutosh_k commented Apr 11, 2019 reply Follow Share I am facing problems in logarithmic conversions. Like how you did the last step of simplifying f(n). Please suggest resources to read about these formulae. 0 votes 0 votes Please log in or register to add a comment.