package day04;
//斐波那契数列
/*
* f(1)=0; 1
* f(2)=1; 2
* f(3)=1; 3
* f(4)=2; 4
* f(5)=3; 5
* f(6)=5; 6
* f(n)=f(n-1)+f(n-2); n
*/
public class Recursion {
static int feiNa(int n){
if(n==1){
return 0;
}else if(n==2){
return 1;
}else{
return feiNa(n-1)+feiNa(n-2);
}
}
public static void main(String[] args) {
System.out.println(feiNa(12));
}
}