in Algorithms retagged by
632 views
0 votes
0 votes

in Algorithms retagged by
632 views

4 Comments

 Shaik Masthan  , check carefully 

 ( login)! Is  unbounded function 

And (loglogn)! is bounded function 

1
1

@Magma

it's my mistake.

0
0
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
0

Please log in or register to answer this question.