Anonymous recursion: Difference between revisions

;Task:

If possible, demonstrate this by writing the recursive version of the fibonacci function   (see [[Fibonacci sequence]])   which checks for a negative argument before doing the actual recursion.

<br><br>