• retagged by
1,546 views

1 Answer

3 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
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
989
989 views
gshivam63 asked May 31, 2016
989 views
It is true or false..(log n)! and (log log n)! are polynomially bounded?What does polynomially bounded means?
0 0 votes
1 answers 1 answer
725
725 views
A_i_$_h asked Oct 17, 2017
725 views
1.(n + a)b = $\Omega$(nb) for all real numbers a , b >02.na+1=theta(nb) iff a=b for all real numbers a , b>0which is true?Acyclic graph directory structure is more flexib...
0 0 votes
0 0 answers
670
670 views
mb14 asked Jul 6, 2022
670 views
Iterative functions:f(n)= n/lognc=2What is f*(n) ?How to solve this question?
0 0 votes
1 1 answer
739
739 views
akash.dinkar12 asked Jun 28, 2019
739 views
Obtain asymptotically tight bounds on $lg\ (n!)$ without using Stirling’s approximation. Instead, evaluate the summation $\sum_{k=1}^{n} lg\ k$.