0 votes 0 votes f(n)=O(g(n)) Which of the following is True? 2^f(n)=O(2^(g(n)) log(f(n))=O(log(g(n)) f(n)=O(f(n/2)) f(n)=O(f(n)^2) Algorithms algorithms time-complexity asymptotic-notation + – Shivam Kasat asked Dec 10, 2018 Shivam Kasat 508 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Mk Utkarsh commented Dec 10, 2018 reply Follow Share answer is B but can someone help me to how to solve these questions with 100% accuracy because i'm always trying to find counterexample and don't know a formal way to solve 0 votes 0 votes Shivam Kasat commented Dec 10, 2018 reply Follow Share @Mk Utkarsh could you please share your solution, I am a bit confused between D and B 0 votes 0 votes Mk Utkarsh commented Dec 10, 2018 reply Follow Share let $f(n) =\frac{1}{n}$ $(f(n))^2 = \frac{1}{n^2}$ $f(n) \neq O(\frac{1}{n^2})$ So D is incorrect and i'm not able to find counter example of B 1 votes 1 votes Shivam Kasat commented Dec 10, 2018 reply Follow Share B is the correct answer bro! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes May be below link will help you https://cs.stackexchange.com/questions/42764/if-fn-ogn-then-is-logfn-ologgn Himanshu Kumar Gupta answered Apr 17, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.