The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
25 views
int fun(int n)

{

int x=1,k;

if(n==1) return x;

for(k=1;k<n;++k)

x=x+fun(k)*fun(n-k)

return x;

}

return value of fun(5)???   how to solve this using tree method approach???
closed as a duplicate of: GATE2015-2-11
asked in Programming by (91 points)
closed by | 25 views
+1

 Phalkey  i tried solving it with tree method but its very tedious, why don't you follow this approach, its best approach for questions like this https://gateoverflow.in/8060/gate2015-2-11

No related questions found



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,584 questions
46,707 answers
140,136 comments
57,865 users