int count(int node)
{
int sum=0;i,left,right;
for(i=0;i<node;i++)
{
left=count(node-1);
right=count(node-i);
sum+=left*right;
}
return(sum);
}-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
