Fibonacci series program in Java using Recursion

In this tutorial we are going to learn how to print Fibonacci series in java program using recursion.

How this Java program will behave?

Its Logic is different from Fibonacci series program in C using iteration.

Here we have a function named fibonacci()  which is recursive. Each time it will call itself to calculate the elements of the series.

This Fibonacci series program will take integer as input. And print series upto given input.

Suppose if someone has given 6 as input, output will be

0, 1, 1, 2, 3, 5

Java program to print Fibonacci series using recursive function

``````import java.util.*;
class Main{
public static void main(String ...a){
int i, k;
Scanner sc= new Scanner(System.in);
System.out.print("Enter number- ");
int n= sc.nextInt();
System.out.println("fibonacci series is: ");
for(i=0;i<n;i++) {
System.out.println(Main.fibonacci(i));
}
}
static int fibonacci(int i){
if(i==0) return 0;
else if(i==1) return 1;
else return (fibonacci(i-1)+fibonacci(i-2));
}
} ``````

Output: