1 1 2 3 5 8 13 21 34 55 89 ...
#include
void main()
{
static int prev_number=0, number=1; // static: so value is not lost
int fibonacci (int prev_number, int number);
printf ("Following are the first 25 Numbers of the Fibonacci Series:\n");
printf ("1 "); //to avoid complexity
fibonacci (prev_number,number);
}
fibonacci (int prev_number, int number)
{
static int i=1; //i is not 0, cuz 1 is already counted in main.
int fibo;
if (i==25)
{
printf ("\ndone"); //stop after 25 numbers
}
else
{
fibo=prev_number+number;
prev_number=number; //important steps
number=fibo;
printf ("\n%d", fibo);
i++; // increment counter
fibonacci (prev_number,number); //recursion
}
}
No comments:
Post a Comment