Asymptotic growth of function

Question

Question

I want to arrange which is asymptotically faster -:

$$n^{100},2^{n},n^{\log\,n}$$

My approach

I know that Exponential function will beat Polynomial function from here

but i am thinking of different way of solving it.

let $$f_{1}=n^{100},f_{2}=2^{n},f_{3}=n^{\log n}$$

Take log both sides-:

$$y_{1}=\log f_{1}=100 *\log\,n$$ $$y_{2}=\log f_{2}=n$$

$$y_{3}=\log \,f_{3}=\log\,(\log\,n*n)$$

hence $$f_{2}>f_{3}>f_{1}$$

Am i right?

Answer 1

Take logarithms of the three quantities, it is then clear that (for sufficinetly large $n$) \begin{eqnarray*} 100 \ln n < (\ln n)^2 < n \ln 2. \end{eqnarray*} So your answer should be $ f_1 < f_3 < f_2 $.