2,224 views
0 votes
0 votes

If c is non-negative but not infinite then :

1.f(n)=O(g(n))

2.f(n)=⊖(g(n)) 

According to me :

it is saying that c is non-negative and not infinite so if g(n) tends to zero then c will tend to infinite but it is given that it is not infinite therefore clearly g(n) should be larger than f(n) , so more precisely we can say f(n)=O(g(n)) ,plz correct me ,if I am wrong

3 Answers

0 votes
0 votes
Given that c is non-negative means that c={0} ∪ {1,2,3...n} and it is also mentioned that it is non-negative so if c=0 ,it implies that f<g and if c >0 then it implies that f =g , so f(n)=O(g(n)) .
0 votes
0 votes

Consider positive functions as $f(n)=n$ and $g(n)=n^2$ for values of $n>=0$

Now, if C is a positive integer, of course $g(n)$ will be greater than $f(n)$ for all values of C

But, if C is a positive fraction, say $1/1000$ Then for some values of $n$ $g(n)$ will be smaller than $f(n)$

Hence, we have $C1 g(n) <= f(n) <= C2 g(n)$

Therefore, $f(n) = \Theta g(n)$

Related questions

6.7k
views
3 answers
1 votes
worst_engineer asked Aug 20, 2015
6,674 views
f(n) = n2 logng(n) = n (logn)10Ans given as g(n) = O(f(n)) and f(n) != O(g(n))But , if I take base of log as 2then for random value of n ( say 16)g(n) = 16 * ... * ( 4 )10and f(n) = 256 * log216 = 256*4So , will it not be f(n) = O(g(n)) ?
2.9k
views
1 answers
3 votes
gate-17 asked Aug 7, 2016
2,919 views
consider the following functions f(n)=log*(log n) , g(n)=log(log* n) relations between these 2 function. please help
13.3k
views
2 answers
7 votes
anshul namdeo asked Jun 6, 2016
13,306 views
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).