Fibbonacci_series.java

//Author's Name : Priyanshi Rai
//Modification Date : 5/10/2022

/*Program to print the fibonacci series with and without recursion
DEFINITION AND LOGIC
In fibonacci series, next number is the sum of previous two numbers.
for example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc. 
The first two numbers of fibonacci series are 0 and 1.
*/

//WITHOUT RECURSION

class FibonacciExample1{  
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;    
 } 
  
//  USING RECURSION
}}  

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