retagged by
563 views
0 votes
0 votes

Given below are 4 functions

  1. $999999n$
  2. $0.99999 n logn$
  3. $1.000001^{n}$
  4. $n^{2}$

The increasing order of the above functions in terms of their asymptotic complexity is?

retagged by

2 Answers

Related questions

0 votes
0 votes
0 answers
1
HeadShot asked Nov 30, 2018
224 views
Why not option B as F(n)= O( F(n) ) is trivial ?
1 votes
1 votes
1 answer
2
Hira Thakur asked Aug 14, 2016
960 views
Big oh estimate forf(x)=(x+1)log($x^2 +1$)+3$x^2$ is given as1.O(xlogx)2.O($x^2$)3.O($x^3$)4O($x^2$logx)
0 votes
0 votes
2 answers
3
srestha asked May 6, 2019
1,225 views
$1)n^{2019}=O\left (n^{2020} \right )$$2)O(n^{2019})=O\left (n^{2020} \right )$Which one is correct??If $1)$ is correct, why $2)$ not correct?
1 votes
1 votes
0 answers
4
shweta sah asked Dec 2, 2018
383 views
Order the following: $\frac{e^{n \log n}}{n}, 2^{n \log n}, n^{\sqrt n}$