Anonymous user
Talk:Anonymous recursion: Difference between revisions
→completion of the task
m (added a query about task description. ~~~~) |
|||
Line 205:
Was it against the rules to have a different version of the recursive call as part of "doThat"?
[[User:Gerard Schildberger|Gerard Schildberger]] 20:39, 18 January 2011 (UTC)
: Surely my REXX skills are near to zero, I just see that the function 'fib' calls the function 'fib' again, which is not "anonymous" (but calls the named function). The task talks about "in-place" recursion, without calling a name. The fibonacci is just thought as a simple example. Anonymous recursion should work stand-alone, completely without the presence of a function. There might in fact be 1000 lines before and 1000 lines after the recursive part. --[[User:Abu|Abu]] 06:52, 19 January 2011 (UTC)
| |||