Find N Fibonacci Series (Using Recursion) .....

package com.alok;
import java.util.Scanner;

class calc
{
int fibo(int n)
{
if(n==0)
return 0;
if(n==1)
return 1;
else
return fibo(n-1)+fibo(n-2);
}
}
public class Fibonacci
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter fibonacci Term :");
int n=sc.nextInt();
System.out.println("Fibonacci Series is :\n");
calc c=new calc();
for(int i=0;i<n;i++)
{
System.out.print("   "+c.fibo(i));
}
}
}

O/P:-


Enter fibonacci Term :
8
Fibonacci Series is :

   0   1   1   2   3   5   8   13