in Algorithms retagged by
627 views
1 vote
1 vote

2n  is the order of 3n  . 

Is it True or False ? State with reason.

in Algorithms retagged by
by
627 views

1 comment

$2^n$  is order of $3^n$

does it mean :  $2^n$=O($3^n$) or $2^n$=o($3^n$)?

if it isO()..then it is false and if it is o() then true?
0
0

1 Answer

3 votes
3 votes

Say f(n)=2n and g(n)=3n

 f(n)=o(g(n))(small-oh) //////not tightest upperbound

so answer is false

edited by

4 Comments

yes, it should be. But "is the order of" is a bit ambiguous
1
1

yes @Arjun Sir

thank u :)

log is not good here

because then both value will be equal to, rather than saying 3n asymptotically larger than 2n

If we get log2 and log3 then these are constant term , So, by this we cannot say one asymptotically larger than another

0
0
yes. Because when we apply log we are changing the functions. i.e., $f(x)$ now becomes $g(f(x))$ where $g$ is the $\log$ function. Still this works for many functions and with some effort one can say for which all cases it won't work.
2
2