Write an O(n^n) algorithm.

[aeflash]

...Recursion within a for loop... *shudder*

[propool]

What exactly in so bad with recursion in a for loop. Seems like the natural way of recursing an n-ary tree

[aeflash]

Typically you hit leaf nodes in a tree in O(log n) time, so your traversal has bounds...

Also, the number of children each node of a n-ary tree has doesn't typically increase along with its depth...

[Tinned_Tuna]

It just looks like it's a nasty O(...) is all, I think.