# include

#include

void main()

{

int a,b,c,num,I; /*variables*/

a=0;

b=1;

printf("how many number you want");

scanf("%d",&num);

for(I=0;I

/*program for fibonacci series using for loop*/

# include

#include

void main()

{

int a,b,c,num,I; /*variables*/

a=0;

b=1;

printf("how many number you want");

scanf("%d",&num);

for(I=0;I

# include

#include

void main()

{

int a,b,c,num,I; /*variables*/

a=0;

b=1;

printf("how many number you want");

scanf("%d",&num);

for(I=0;I

C program for Fibonacci series using a loop and recursion. Using the code below you can print as many terms of the series as required. Numbers of this sequence are known as Fibonacci numbers. The first few numbers of the series are 0, 1, 1, 2, 3, 5, 8, ...,. Except for the first two terms of the sequence, every other term is the sum of the previous two terms, for example, 8 = 3 + 5 (addition of 3 and 5). This sequence has many applications in Mathematics and Computer Science.

/* Fibonacci series program in C language */

#include <stdio.h>

int main()

{

int n, first = 0,

second = 1, next, c;

printf("Enter

the number of termsn");

scanf("%d", &n);

printf("First

%d terms of Fibonacci series are:n", n);

for (c = 0; c <

n; c++)

{

if (c <= 1)

next = c;

else

{

next = first +

second;

first = second;

second = next;

}

printf("%dn",

next);

}

return 0;

}

if you want to learn c Programming, then you can get help from experts at CodeAvail- Online Computer Science Assignment

help

Void fib(int no)

{

int a=0,b=1,c = 1,I;

if(no>0)

{

for(I=0;I

{

int a=0,b=1,c = 1,I;

if(no>0)

{

for(I=0;I

Fibonacci series using do while loop

#include

#include

main()

{

int a=0,b=1,c,I,n;

clrscr();

printf("enter the limit of series\n");

scanf("%d",&n);

printf("%d\n%d\n",a,b);

for(I=1;I

#include

main()

{

int a=0,b=1,c,I,n;

clrscr();

printf("enter the limit of series\n");

scanf("%d",&n);

printf("%d\n%d\n",a,b);

for(I=1;I

Void main ()

{

int I,j,k;

for(I=-1,j=1;I

{

int I,j,k;

for(I=-1,j=1;I

Didn't find the answer you were looking for?