[algogeeks] Re: Needed recursive sol

[akanksha]

int sum(int f0,int f1)
{
    if(f1<=1000)
    {
            int x= sum(f1,f0+f1);
            if(f1%2==0) x+=f1;
            return x;
    }
    else
    return 0;
}

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@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.