This program is related to the generation of Fibonacci numbers.
For example: 0,1, 1,2, 3,5, 8, 13,… is a Fibonacci sequence where 13 is the 8th Fibonacci number.
Program :
import java.util.Scanner; //This package for reading input
public class Fibonacci {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt(); //Read an integer
System.out.println(fib(n)); //Generate and print the n-th Fibonacci
//number
}
static int fib(int n) {
if (n==1) //Terminal condition
return 0;
else if(n==2)
return 1;
return fib(n - 1) + fib(n - 2); //Recursive call of function
}
}
Input | Output | |
Test Case 1 | 8 | 13 |
No comments:
Post a Comment