in Algorithms
948 views
2 votes
2 votes
in Algorithms
948 views

3 Comments

log n^n will be having larger growth
0
0
What is approach for solving such ambiguous question..

I tried to use L-hospital but again function's are for form $\frac{\infty}{\infty}$
0
0
(log n)^n will be larger
0
0

1 Answer

3 votes
3 votes
Best answer

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

1 comment

nice
0
0