How to write a C program to generate Fibonacci series up to 10 elements and store in array?

Answer 1

#include <iostream.h>

#include <conio.h>

#include <stdlib.h>

int swap(int* , int*);

int main()

{

int c=0;

int b=1;

int max;

cout<<"Enter the maximum limit of fibbonacci series = ";

cin>>max;

if(max>0)

{

cout<<c<<endl;

}

else

{

exit (EXIT_FAILURE);

}

for(int i=0;i<max;i++)

{

c=b+c;

swap(&b,&c);

if(c<max)

{

cout<<c<<endl;

}

else

{

break;

}

}

getch();

return 0;

}

int swap(int *x,int *y)

{

int z;

z=*x;

*x=*y;

*y=z;

return z;

}

Answer 2

int array[10];

int i;

array[0] = 0;

array[1] = 1;

for (i=2; i<10; i++) array[i] = array[i-1] + array[i-2];

for (i=0; i<10; i++) printf ("%d\n", array[i]);

Warning: Fibonacci number grow large fast, and will overflow any fixed precision binary format. In the case of 32 bit signed binary numbers, the maximum term that can be generated is 47, array[46]

Answer 3

Fibonacci series has absolutely nothing to do with pointers.