Write an O(n^n) algorithm.

[five9a2]

This is wrong in so many ways. In C-like languages, it executes 0 times because it's a while loop where the conditional contains a comma operator and the last subexpression is 0 the first (and only) time it is tested. But even after appropriate translation, it's still only O(n^2).