Can someone please check if the following big O estimate is correct? Thanks!
n^2n + n^(n^2)
Big O Estimate: O(n^n) since n^n must be faster than n^(n^2)?
This is $\displaystyle O(n^{n^2})$, since $\displaystyle n^{2n}$ is negligable
in comparison to $\displaystyle n^{n^2}$, for large enough $\displaystyle n$