Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Recursion
Could someone explain to me how this recursion work? Thanks
** I understand recursion method with 1 base case but don't understand when it 2 base case.
x = 4 and the answer is 3 but I don't know how the recursion work. I try to print out what the program is doing but still don't understand. Any help on how this recursion(Equation) work is appreciated.
public int numFibo(int x) { if(x==0) { return 0; } else if(x==1) { return 1; } else { return(numFibo(x- 1)+numFibo(x-2));
Related threads:
Re: Recursion
What is being passed to the method numFibo? How is that value being manipulated in the code? Try using print statements throughout your code to see how data changes.
This recursion is made up of 3 basic components the if-statement, returns, and a method. You should look up these components in detail to get a better understanding of how your code is functioning.
If-statements
Methods
Returns
Reply With Quote