made easy test

Question

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?

Comments

We have linear, logarithmic, quadratic and exponential function. Among them exponential have higher rate of growth.

$1<2<4<3$

Answer 1

order is 1, 2 ,4, 3

Comments

can you explain? plzz

---

3should be highest because it's exponential function

2 logarithmic

Answer 2

I hope the explanation is clear.