Home >>Java Programs >Fibonacci Series Program in Java using recursion
In this example, we will see a Java program through which we will find the Fibonacci series.
A series of numbers can be called a Fibonacci series if the next number is the sum of the previous two numbers. For example 0, 1, 1, 2, 3, etc.
In this program here, we will find the Fibonacci series using the recursion in Java.
Program
class Main
{
static int n1=0,n2=1,n3=0;
static void printFibonacci(int count)
{
if(count>0)
{
n3 = n1 + n2;
n1 = n2;
n2 = n3;
System.out.print(" "+n3);
printFibonacci(count-1);
}
}
public static void main(String args[])
{
int count=10;
System.out.print(n1+" "+n2);//printing 0 and 1
printFibonacci(count-2);//n-2 because 2 numbers are already printed
}
}