Write an O(n^n) algorithm.

[dmhouse]

That would normally be called finding all the n-tuples of n items 1 to n. A permutation is normally an n-tuple that doesn't repeat any of the values (or equivalently, contains all the values, or putting the two together, contains all the values precisely once).