无穷数列1,1,2,3,5,8,13,21,34,55,……,称为Fibonacci数列。它可以递归地定义为:
第n个Fibonacci数可递归地计算如下:
int fibonacci(int n)
{
if (n <= 1) return 1;
return fibonacci(n-1)+fibonacci(n-2);
}
编写完整的主函数,分别记录利用上述递归函数求第47, 48, 49, 50, 51,52个Fibonacci数所花费的时间。
package work;
public class Fibonacc {
public static void main(String[] args) {
long lstart1 = System.currentTimeMillis();
Fibonacci(47);
long lend1 = System.currentTimeMillis();
long time = (lend1 - lstart1);
System.out.println("第47个 Fibonacci花费的时间为:"+time+"ms");
long lstart2 = System.currentTimeMillis();
Fibonacci(48);
long lend2 = System.currentTimeMillis();
long time1 = (lend2 - lstart2);
System.out.println("第48个 Fibonacci花费的时间为:"+time1+"ms");
long lstart3 = System.currentTimeMillis();
Fibonacci(49);
long lend3 = System.currentTimeMillis();
long time2 = (lend3 - lstart3);
System.out.println("第49个 Fibonacci花费的时间为:"+time2+"ms");
long lstart4 = System.currentTimeMillis();
Fibonacci(50);
long lend4 = System.currentTimeMillis();
long time3 = (lend4 - lstart4);
System.out.println("第50个 Fibonacci花费的时间为:"+time3+"ms");
long lstart5 = System.currentTimeMillis();
Fibonacci(51);
long lend5 = System.currentTimeMillis();
long time4 = (lend5 - lstart5);
System.out.println("第51个 Fibonacci花费的时间为:"+time4+"ms");
long lstart6 = System.currentTimeMillis();
Fibonacci(52);
long lend6 = System.currentTimeMillis();
long time5 = (lend6 - lstart6);
System.out.println("第52个 Fibonacci花费的时间为:"+time5+"ms");
}
public static int Fibonacci(int n){
if( n == 0 ) return 0;
if( n == 1 ) return 1;
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
}