
recursive method to comput psF(n)
can someone explain to me how recursive methods work
we went over it in class but i was not listening and now i'am to scared to tell the teacher. can't focus for more than 50 mins at a time
how can you use a method within it self
static int psF(int n) {
if(n<2)
return n;
else
return 2*psF(n1)+psF(n2);
}
how can he use a method call with in a method
Last edited by Mcody2; 11302006 at 03:30 PM.

Here your fibonacci program
import javax.swing.*;
public class Fibo
{
static long fibo(int n) {
if(n==0) //Stop
return n;
else if (n==1)
return 1;
else
return fibo(n1)+fibo(n2);
}
public static void main(String[] args)
{
String stNo=JOptionPane.showInputDialog("Enter n>0: ");
int n=Integer.parseInt(stNo);
JOptionPane.showMessageDialog(null,"Fibonacci number at n "+n+" is "+fibo(n));
}
}

Originally Posted by Mcody2
can someone explain to me how recursive methods work
we went over it in class but i was not listening and now i'am to scared to tell the teacher. can't focus for more than 50 mins at a time
how can you use a method within it self
static int psF(int n) {
if(n<2)
return n;
else
return 2*psF(n1)+psF(n2);
}
how can he use a method call with in a method
If you don't understand some code, try putting some System.out.println() statements in it to see what's happening to the variables in your code.
The previous' posters code can even be shortened with only one ifstatement:
Code:
public class Fibo {
public static int fibonacci(int n) {
System.out.println("********************************************");
System.out.println("Begin of the method, n = "+n);
if(n < 2) {
System.out.println("  returning: "+n);
return n;
} else {
System.out.println("  calling fibonacci("+n+"1)+fibonacci("+n+"2)");
return fibonacci(n1)+fibonacci(n2);
}
}
public static void main(String[] args) {
int N = 4;
System.out.println("\n\nAnswer fibonacci("+N+") = "+fibonacci(N));
}
}
When you run the code the following will be printed:
Code:
********************************************
Begin of the method, n = 4,
 calling fibonacci(41)+fibonacci(42) [1]+
******************************************** 
Begin of the method, n = 3, 
 calling fibonacci(31)+fibonacci(32) <+ [2]+
********************************************  
Begin of the method, n = 2,  
 calling fibonacci(21)+fibonacci(22)  <+ [3]+
********************************************   
Begin of the method, n = 1,   
 returning: 1   <+
********************************************   
Begin of the method, n = 0,   
 returning: 0   <+
********************************************  
Begin of the method, n = 1,  
 returning: 1  <+
******************************************** 
Begin of the method, n = 2, 
 calling fibonacci(21)+fibonacci(22) <+ [4]+
******************************************** 
Begin of the method, n = 1, 
 returning: 1 <+
******************************************** 
Begin of the method, n = 0, 
 returning: 0 <+
Answer fibonacci(4) = 3
I've drawn some arrows to show how the flow of the recursive calls work. As you can see, the number 1 gets returned three times, which is the answer.
Hope it's clear to you now.
Good luck.

Originally Posted by prometheuzz
...
The previous' posters code can even be shortened with only one ifstatement:
...
If you really want to shorten it, you can even put it all in one line:
Code:
public static int fib(int n) {
return n < 2 ? n : fib(n1)+fib(n2);
}
; )

thanks prometheuzz that helped alot, also good advice about inserting print lines i remember reading that in my text somewere thought it was a waste of time lol now i see it is good programming practice.
Similar Threads

Replies: 2
Last Post: 09032008, 10:14 AM

Replies: 2
Last Post: 08052006, 10:40 PM

Replies: 1
Last Post: 04212006, 11:51 AM

Replies: 1
Last Post: 04132006, 04:57 AM

Replies: 3
Last Post: 04132001, 09:13 PM
Posting Permissions
 You may not post new threads
 You may not post replies
 You may not post attachments
 You may not edit your posts

Forum Rules

Development Centers
 Android Development Center
 Cloud Development Project Center
 HTML5 Development Center
 Windows Mobile Development Center
