963 views
2 votes
2 votes

1 Answer

Best answer
3 votes
3 votes

Consider $n=2^{64}$.

$n^{logn}={2^{64*64}} =$ $2^{2^{12}}$ whereas ${(logn)}^n = 64^{2^{64}}=2^{6*{2^{64}}}\ge 2^{4*{2^{64}}}$$=2^{2^{68}}$.

Considering a greater $n = 2^{256}$,we have:

$n^{logn}=2^{256*256} $$=2^{2^{16}}$ whereas $(logn)^n = {2^{8*2^{258}}}$$=2^{2^{261}}$.

You can clearly see the difference in the growth rates of the two functions. Thus asymptotic growth of $n^{logn} \le (logn)^n $

selected by

Related questions

4 votes
4 votes
3 answers
1
radha gogia asked Nov 22, 2015
891 views
According to me $n^3$ should be asymptotically greater since $(\log n)!$ is computed like $\log n$ will be a small constant less than $n$ and when I calculate its factori...
1 votes
1 votes
0 answers
2
firki lama asked Jan 18, 2017
424 views
Which grows faster when n increases?$I. n^{\frac{1}{3}}<\frac{n}{logn}II. n^{\frac{1}{3}}>\frac{n}{logn}$
2 votes
2 votes
1 answer
3
0 votes
0 votes
2 answers
4