Login/RegisterProgram Discussion :: Basics
293 / 279
Write a recursive function to print 100 Fibonacci numbers.
Answer:
public class Fibonacci
{
static int a=0,b=1,c=0;
public void fibonacci(int num)
{
if(num>0)
{
c=a+b;
a=b;
b=c;
System.out.print(" "+c);
fibonacci(num-1);
}
}
public static void main(String args[])
{
Fibonacci ob=new Fibonacci();
int num=100;
System.out.print(a+" "+b); //printing 0 and 1
ob.fibonacci(num-2); //n-2 because 2 numbers are already printed
}
}
Asked In ::
Language:
Siddhartha Paul
19 Jun, 2019 2:16 PM
public class Fibonacci
{
static int a=0,b=1,c=0;
public void fibonacci(int num)
{
if(num>0)
{
c=a+b;
a=b;
b=c;
System.out.print(" "+c);
fibonacci(num-1);
}
}
public static void main(String args[])
{
Fibonacci ob=new Fibonacci();
int num=100;
System.out.print(a+" "+b); //printing 0 and 1
ob.fibonacci(num-2); //n-2 because 2 numbers are already printed
}
}
