Write a program to print first 'n' Fibonacci 100 numbers?

Answer 1

#include<stdio.h> #include<conio.h> void fibo(int); void main() { int num; clrscr(); printf("\n\t Enter number of elements in series : "); scanf("%d",&num); if(num>0) fibo(num); else printf("\n\t Please enter positive number "); } void fibo(int num) { int a=0,b=1,c=0; if(num==1) printf("\n%d",a); if(num>=2) printf("\n%d\t%d\t",a,b); for(;num>2;num--) { c=a+b; a=b; b=c; printf("%3d\t",c); } getch(); }

Answer 2

#include <stdio.h>

#include <conio.h>

int fab(int);

main()

{

int n,i;

printf("enter the value of n\n");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

printf("%d\n",fab(i));

}

getch();

}

int fab(int n)

{

if(n==1)

return 1;

else if(n==2)

return 1;

else

return fab(n-1)+fab(n-2);

}

Answer 3

This program prints the Fibonacci series

#include<stdio.h>

#include<conio.h>

void main(void)

{

int i,j,k,n;

clrscr();

i=0;

j=1;

printf("%d %d ",i,j);

for(n=0;n<=5;n++)

{

k=i+j;

i=j;

j=k;

printf("%d ",k);

}

getch();

}

Answer 4

#include <stdio.h>

int main(int argc, char **argv)

{

if (argc < 3) {

printf("Usage: %s min max\n", argv[0]);

return -1;

}

int a = 1, b = 1, c;

int min = atoi(argv[1]), max = atoi(argv[2]);

if (min <= 1)

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

while (b < max) {

c = a + b;

a = b;

b = c;

if ((b >= min) && (b <= max))

printf("%d ", b);

}

printf("\n");

return 0;

}

Answer 5

Fibonacci numbers grow very fast. For instance, term 49 has value 4,807,526,976, whichs exceeds the limit (4,294,967,295) of a 32 bit unsigned integer, and term 95 has value 19,740,274,219,868,200,000, which exceeds the limit (18,446,744,073,709,551,615) of a 64 bit unsigned integer. Any program that calculates large Fibonacci numbers must deal with this limitation, and that is much more involved than just the algorithm to generate the numbers. (T0 = 0, T1 = 1, TN(>1) = TN-2 + TN-1) In order to properly generate large Fibonacci numbers, you need to use, or develop, a large integer/decimal class, such as an arbitrary length decimal class. One way to do this is to create a class that contains a linked list, each element containing one digit or integer. Then you create methods that allow, in this case, addition, of classes using the rules of arithmetic with carry. Its the same as writing it down on paper.

Answer 6

Fibonacci number grow large quickly, and soon exceed the bounds of the computer's binary representation. With 32-bit unsigned integers, the maximum Fibonacci number is the 48th term, or 2,971,215,073. With 64-bit unsigned integers, the maximum Fibonacci number is the 94th term, or 12,200,160,415,121,876,738. To get larger terms, you need an arbitrary length decimal math library.

Here is a program using 64-bit integers. It works on the Microsoft Windows SDK 7. The long long datatype and the %I64u format specification might not be ANSI portable.

#include

int main (int argc, char *argv[]) {

int n, i;

unsigned long long a=0,b=1,c;

if (argc < 2) {

fprintf (stderr, "Usage: fib1 N\n");

return 1;

} else n = atoi (argv[1]);

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

for (i = 2; i <= n; i ++) {

c = a + b;

printf ("%I64u\n", c);

b = a;

a = c;

}

return 0;

}
main()

{

int a=0,b=1;

int d;

printf("1 : %d\n2 : %d",a,b);

for (i=3; i<50; i++)

{

d=a+b;

a=b;

b=d;

printf("%d : %d\n",i,d);

}

getch();

}

Answer 7

// recursive method

unsigned long fib (unsigned long n) {

if (n 2) return 1;

return fib (n-1) + fib (n-2);

}

// iterative method

unsigned long fib (unsigned long n) {

unsigned long N[3] = { 0, 1, 1 };

if (n <=3) return N[n-1];

while (n > 3) {

N[0] = N[1];

N[1] = N[2];

N[2] = N[0] + N[1];

--n;

}

return N[2];

}