Programming -3

Question

fun(a,b)
{
   if(a<0 && b<0)
   return 0;
   else if(a==0) return b+1;
   else if(b==0) return fun(a-1,1);
   else return fun(a-1,fun(a,b-1));
}

compute fun(3,1)

Comments

13 .......

---

yes, plz elaborate
can do with recursive tree?

---

@srestha yes, you can draw the recursion tree.

---

i'm finding no easy way to evaluate , solved by that expected ordinary method , got 13.

if you want this ordinary solution i can post...

but with this ordinary method , at exam time it's hard to keep patience and focus to solve correctly.

after i got answers , there is kind of relations b/w values which i'm not able to interpret like

f(1,x)=x+2    f(2,x)=2x+3....

Answer 1

output is 13.

Answer 2

Output will be 13