recursivefibonacci.java

来自「利用递归计算Fibonacci数列」· Java 代码 · 共 39 行

/**
 * AWT Sample application
 *
 * @author 
 * @version 1.00 04/12/06
 */
 import java.io.*;
public class RecursiveFibonacci {
	static int m;
	static final int LIMIT=15;
    
    public static void main(String[] args) throws IOException{
      int n,f1;
      System.out.println("number of method calls \n");
    System.out.println("Value of N|"+"Valude of i"+"required to rescrusively");
    System.out.println("|"+"fibonacci(n)|"+"compute fiboncci(n)");
    System.out.println("-----------------|---------|----------");
    for(n=0;n<LIMIT;n++)
    {
    	m=0;
    	RecursiveFibonacci f=new RecursiveFibonacci();
    	f1=f.fibonacci(n);
    	System.out.print(""+n+"\t\t"+f1+"\t\t"+m);
    	System.out.println();
    	}
    	System.out.println();
    	System.in.read();
    	
    }
    int fibonacci(int n)
    {m++;
    if(n<=1)
    return n;
    else return fibonacci(n-1)+fibonacci(n-2);
    
    }
    }