This is regarding this question How do I convert a doubly recursive method to a loop?
The question is about converting a recursive function with 2 recursive calls to a loop. This is pretty hard to do. I tried it, and got completely confused :P
So I came back to see if anyone had an answer. But the question was closed by then with the reason being "not a real question".
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, see the FAQ.
I don't think this question is ambiguous, vague, incomplete, overly broad, or rhetorical. And I am sure someone smart enough to figure it out will be able to answer it. I even found this answer which says
there is nothing that can be done with recursion and that cannot be done with a loop and a stack.
So yes, the question can definitely be answered. So can anyone explain why it was closed? And is there a way to ask for it to be reopened?