# Recursion - function call trees

Ralph Cook

Ranch Hand

Posts: 479

posted 5 years ago

One way is to treat the function call as returning a single value; we know that it does that by invoking a method, but we can ignore that momentarily while we reason through things.

ex234(5) ends up as ex234(2) + 5 + ex234(3) + 5

Now we can determine the value returned by each of those

ex234(2) ends up as ex234(-1) + 2 + ex234(0) + 2

ex234(3) ends up as ex234(0) + 3 + ex234(1) + 3

We know that each of the ex234(0) and ex234(less than 0) end up as empty strings. That leaves us with

ex234(1) as ex234(-2) + 1 + ex234(-1) + 1 => "" + 1 + "" + 1 => "11"

So this gives us

ex234(3) as "" + 3 + "11" + 3 => "3113"

ex234(2) as "" + 2 + "" + 2 => "22"

and now we can substitute back into the first expression

ex234(5) as "22" + 5 + "3113" + 5 => "22531135"

I hope that's right; I haven't run the code...

rc

ex234(5) ends up as ex234(2) + 5 + ex234(3) + 5

Now we can determine the value returned by each of those

ex234(2) ends up as ex234(-1) + 2 + ex234(0) + 2

ex234(3) ends up as ex234(0) + 3 + ex234(1) + 3

We know that each of the ex234(0) and ex234(less than 0) end up as empty strings. That leaves us with

ex234(1) as ex234(-2) + 1 + ex234(-1) + 1 => "" + 1 + "" + 1 => "11"

So this gives us

ex234(3) as "" + 3 + "11" + 3 => "3113"

ex234(2) as "" + 2 + "" + 2 => "22"

and now we can substitute back into the first expression

ex234(5) as "22" + 5 + "3113" + 5 => "22531135"

I hope that's right; I haven't run the code...

rc