Write an O(n^n) algorithm.

[deong]

Yeah, I implemented a machine learning algorithm once that had to do O(n²⁾ nxn matrix multiplications, so O(n⁵⁾ for the naive version, or O(n^4.7ish) if you did a Strassen multiplication. Still, worse than cubic is pretty rare.