What is the Big-O time complexity of n to the power n

1.9k Views Asked by At

For a given positive integer $n$, what is the $O( )$ time complexity of computing $n^n$, that is, $n$ to the power $n$? I think I know the solution but wasn't sure if it was correct. My solution that I got was O(n log(n)).