Java Programlama 1- Recursive Örnekler 12

Girilen sayının Fibonacci ifadesini bulan program

[java]

import java.util.Scanner;

//recursive fibonacci
public class ondort {

public static int fib(int n){
if (n==0)
return 0;
else if(n==1)
return 1;
else
return fib(n-2)+fib(n-1);

}
public static void main(String[] args) {
Scanner gir=new Scanner(System.in);
System.out.println("Bir sayi giriniz:");
int n=gir.nextInt();
System.out.println("sonuc:"+ fib(n));
}

}

[/java]