I'm comparing $f(n)$: O(logn^logn) vs. $g(n)$: O(n/logn).
I multiplied logn to both sides, then it will be logn^(1+logn) vs n.
Question: what do we do here next to compare two functions?
My solution for textbook says,
$f(n)$ is $n^{\log\log n}$ , so $f(n)$ is superior to $g(n)$. $\leftarrow$ I don't understand why it's $n^{\log\log n}$.
$\leftarrow$ I guess $n^{\log\log n}$ is $n^{\log 10+\log n}$.
$$\log(n)^{\log(n)} = \left ( b^{\log(\log(n))} \right )^{\log(n)}=(b^{\log(n)})^{\log(\log(n))}=n^{\log(\log(n))}$$
assuming the log is base $b$. Since $\log(\log(n))$ is growing, this grows faster than just $n$ which has a fixed exponent.