This is very impressive for productivity, but even if it's correct, the algorithm is a lot easier to write in exponential time than in quadratic time. Did SudoLang come up with an efficient algorithm? Was the algorithm you showed (a standard way to change the natural recursive algorithm to iterative form) what it generated?

If it generates some code, does it have any idea about what the computational complexity is, if you ask it?