Java Program of Fibonnaci number with and without Recursion

import java.util.Scanner;

public class Fibonnaci {

public static void main(String[] args) {

//Without Recursion

Scanner s=new Scanner(System.in);
int a=0,b=1,c;
int n=s.nextInt();
System.out.print(a +" ");
System.out.print(b);
for(int i=0;i<n;i++)
{
System.out.print(" ");
c=a+b;
a=b;
b=c;
System.out.print(c);
}
System.out.println("Fibo using recursion");
int num=s.nextInt();

int ab=0, ba=1;
System.out.print(ab +" "+ ba);
fibonacci(n);
}

//With Recursion
static int n1=0,n2=1,n3=0;    
static void fibonacci(int count){    
    if(count>0){    
         n3 = n1 + n2;    
         n1 = n2;    
         n2 = n3;    
         System.out.print(" "+n3);   
         fibonacci(count-1);    
     }    
}    

}