0 votes 0 votes Algorithms asymptotic-notation algorithms + – Deepalitrapti asked Sep 4, 2018 • retagged Jun 12, 2022 by makhdoom ghaya Deepalitrapti 618 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Magma commented Sep 4, 2018 reply Follow Share Shaik Masthan , check carefully ( login)! Is unbounded function And (loglogn)! is bounded function 1 votes 1 votes Shaik Masthan commented Sep 4, 2018 reply Follow Share @Magma it's my mistake. 0 votes 0 votes abhi19961 commented Sep 15, 2018 reply Follow Share How can you prove option "c" without any actual value of the function g(n)? g(n) determines is the condition holds or not,i mean O(g(n)) it can be anything ? 0 votes 0 votes Please log in or register to add a comment.
