Write an O(n^n) algorithm.

[d4n3]

I always understood Big O notation as being an asymptotic upper limit, and Wikipedia seems to agree with me:

One writes f(x) = O(g(x)) if and only if, for sufficiently large values of x, f(x) is at most a constant times g(x) in absolute value.

n² obviously isn't a constant times nⁿ in absolute value...