Read Time:23 Second
Fibonacci Series in Java using recursion.
Let’s see the Fibonacci series program in java with recursion:

class Program{ 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 } }