Fibonacci series Program in Java

The Fibonacci series is a sequence of numbers where each subsequent number is the sum of the two preceding numbers. For instance, the Fibonacci series begins with 0 and 1 and continues as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, and so on. This pattern persists throughout the series, with each number being the sum of the two preceding numbers.

There are two ways to write the Fibonacci series program in Java:

• Fibonacci Series without using recursion
• Fibonacci Series using recursion

Fibonacci Series Program without using recursion in Java

Program:

class FibonacciExample{  
public static void main(String args[])  
{    
 int n1=0,n2=1,n3,i,count=10;    
 System.out.print(n1+" "+n2);//printing 0 and 1    
    
 for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed    
 {    
  n3=n1+n2;    
  System.out.print(" "+n3);    
  n1=n2;    
  n2=n3;    
 }    
  
}}

Output:

0 1 1 2 3 5 8 13 21 34

Fibonacci Series program using recursion in Java

Program:

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

Output:

0 1 1 2 3 5 8 13 21 34

To learn more, follow tutorials.freshersnow.com for topics such as Java program for the Fibonacci series.