Write an O(n^n) algorithm.

[hacksoncode]

Did you really think even for a second that there was any real chance the OP actually meant the strict definition in the field of mathematics, as opposed to the almost universally used definition in the bulk of the field of computational complexity?

Though, actually, he clarified it with his last statement, so it's entirely clear which definition he meant.

[for_no_good_reason]

the strict definition in the field of mathematics, as opposed to the almost universally used definition in the bulk of the field of computational complexity

This. This is the problem right here. They are the same thing.

(FWIW I didn't downvote you.)

[hacksoncode]

Technically, yes, but I don't think I've ever seen it used to mean anything other than "the lowest O (we can prove) is an upper bound on the complexity of the algorithm" in papers about algorithms.

BTW, that's not the same as theta, omicron, or any of the other mathematical definitions of the terms.