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)?

Printable View

- Mar 9th 2006, 11:52 AMhotmail590Big O Estimate
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)? - Mar 9th 2006, 12:08 PMCaptainBlackQuote:

Originally Posted by**hotmail590**

in comparison to $\displaystyle n^{n^2}$, for large enough $\displaystyle n$

RonL - Mar 9th 2006, 10:23 PMCaptainBlackQuote:

Originally Posted by**hotmail590**

$\displaystyle

n^{2n} + n^{n^2} = O(n^{n^2})

$

and:

$\displaystyle

n^{2n} + n^{n^2} = n^{n^2} + O(n^{2n})

$

RonL