我已经按照以下方式编写了斐波那契数列。我想知道是否下面的递归使用方式是正确的,因为我认为我正在使用类似于for循环的条件和递增值来循环斐波那契函数。
public class FibanocciSeriesImpl {
static int a,b,i,n;
static
{
a=0; b=1;i=2;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number of elements in the series");
n=sc.nextInt();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("The fibnocci series is below");
System.out.print(a+","+b);
fibnocciImpl(a,b);
}
public static void fibnocciImpl(int a,int b)
{
int c=a+b;
a=b;
b=c;
i++;
System.out.print(","+c);
if(i<n)
fibnocciImpl(a,b);
}
}