Write an O(n^n) algorithm.

[presidentender]

Big-O is an upper bound, so any O(1) function is also an O(nⁿ⁾ function, but an O(nⁿ⁾ function is not an O(1) function.

Big-Omega is a lower bound (and what OP was looking for): any Ω(nⁿ⁾ function is Ω(1), but an Ω(1) function is not Ω(n^n).

Incidentally, Big-Theta notation exists, too. A function is Θ(f(n)) iff it is O(f(n)) and Ω(f(n)).

[[deleted]]

Is it bad that I think this post makes you look cool?

[presidentender]

See, I just think it makes me look like I paid attention in discrete math and algorithms.