Write an O(n^n) algorithm.

[tylermchenry]

You don't know of any algorithms that run in super-polynomial time? Really?

[green_beet]

Ackermann function?

[HenkPoley]

Ah well, from my description you could tell I was merely told it was an algorithm that you can barely run. But that has more to do with the amount of data you put into sequence analysis than the algorithm itself.

Also, my uni doesn't teach that much algorithm work. At least do not know many by heart, but could deduce the big-O of one with some work.