How to order the functions $2^n$ vs $n^{\log n}$ based on their complexity?
I found this question in a programming website (InterviewBit). But the answer given there, $n^{\log n}, 2^n$, does not seem convincing.
The graph of the two functions also indicates that $n^{\log n}$ is more complex than $2^n$.
I also tried substituting a couple of large value for $n$ like $10^{10}$ or $10^{10000}$. They all seem to indicate that $n^{\log n}$ is more complex than $2^n$.
- Is $n^{\log n}$ greater than $2^n$?
- Assuming 1 is true, how to prove it without using graphs?