edited by
3,043 views
0 0 votes

Order the following functions in increasing order of their growth rate.
(i) nlogn
(ii) $n \log (\log n)$
(iii) $n \log \left(\mathrm{n}^{\mathrm{n}}\right)$
(iv) $n(\operatorname{logn})^{2}$

  1. i , ii , iii , iv
  2. ii , iv, i , iii
  3. i, iii, ii, iv
  4. iv, ii , i , iii

2 Answers

0 0 votes
I am calculating it like below.

let n = 2^2^3

(i) nlog n = 2^8 * 8

(ii) n log(log n) = 2^8 * 3

(iii) n log(n^n) = 2^8 * 2^8 * 8

(iv) n (log n)^2 = 2^8 * 16

So the order is 3,4,1,2

Not sure if I'm doing something wrong.
0 0 votes

Put $n = 2^{16}$

i) $n log  n \rightarrow 2^{16} log 2^{16} = 2^{16} . 16 = 2^{20}$

ii) $n log(log n) \rightarrow 2^{16} log (log (2^{16})) = 2^{16} . 4 = 2^{18}$

iii) $n log (n^n) \rightarrow n^2 logn = ({2^{16}})^2 log( 2^{16}) = 2^{32}.16 = 2^{36}$

iv) $n (logn)^2 \rightarrow 2^{16} (log (2^{16}))^2 = 2^{16}. 256 = 2^{16}. 2^8 = 2^{24}$

Therefore the correct increasing order is $ii < i < iv < iii.$

So, the answer is None of these.

Position:
Show:

Related questions

3 3 votes
1 answers 1 answer
2.8k
2.8k views
sunil sarode asked Dec 19, 2017
2,807 views
Which of the following options provides the increasing order of asymptotic complexity of functions(Note: Consider log base 2)a) f1(n)=n logn log lognb) f2(n)=(n!)^1/nc) f...
4 4 votes
1 1 answer
119
119 views
GO Classes asked Jul 29
119 views
Arrange the following functions in increasing order of asymptotic growth:$f_1(n) = n^{0.999999}\log n$ $f_2(n) = 10000000n$ $f_3(n) = 1.000001^n$ $f_4(n) = n^2$ $f_1(n)< ...
1 1 vote
0 0 answers
646
646 views
Mayankprakash asked Sep 7, 2018
646 views
1.What is exact difference between order of growth of the function and asymptomatic growth of the functions?Please suggest on above point.
1 1 vote
1 1 answer
1.1k
1.1k views