Write a method that returns a Fibonacci sequence from 1 to n.

The Fibonacci sequence is a list of numbers, where the next value in the sequence is the sum of the
last two. The sequence defines that the first number is zero, and the next is one.

class FibonacciwithoutRecursion{  
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) {    
  n3=n1+n2;    
  System.out.print(" "+n3);    
  n1=n2;    
  n2=n3;    
 }    
  
}} 

Fibonacci series with using recursive function,

class FibonacciRecursion{  
 static int n1=0,n2=1,n3=0;    
 static void printFib(int count){    
    if(count>0){    
         n3 = n1 + n2;    
         n1 = n2;    
         n2 = n3;    
         System.out.print(" "+n3);   
         printFib(count-1);    
     }    
 }    
 public static void main(String args[]){    
  int count=10;    
  System.out.print(n1+" "+n2);//printing 0 and 1    
  printFib(count-2);//n-2 because 2 numbers are already printed   
 }  
}