[techno_kid]

how will you form an algorithm/program ( any language ) to print the fibonacci numbers?

thanks for the help.. =)

[snif innards]

a simple version:

PHP Code:

<?
$x = 0;
$y = 1;
for($i=0; $i<20; $i++){
$z = $x + $y;
$x=$y;
$y=$z;
echo $z."
\n";
}
?>

[techno_kid]

oh thanks snif... =)

any other example there guys ?

thanks =)

[simple]

this program is in C language. hope you find it useful.

//program for fibonacci numbers
#include<stdio.h>
int main()
{
int old,cur,new,i,num;
printf("\nEnter the number of iterations you want to be performed: ");
scanf("%d",&num);
old=new=0;
cur=1;
printf("the fibonacci series is....\n");
printf("\t%d",old);
printf("\t%d",cur);
for(i=2;i<=num;i++)
{
new=old+cur;
printf("\t%d",new);
old=cur;
cur=new;
}
return 0;
}

[techno_kid]

thanks simple...

this would surely help me... =)

[TheHeadFL]

Another simple method for finding the n-th fibbonacci number using recursion:

int fib(int n)
{
   if (n == 1) return 1;
   if (n == 2) return 1;
   return fib(n-1) + fib(n-2);
}

[techno_kid]

oh thanks TheHeadFL..

this is pretty short and simple.. =)

[TheHeadFL]

Keep in mind though that using that method to print out a list of all the fibbonacci numbers would be extremely inefficient since each time you call it it generates a lot of function calls. (It calls itself approximately 2^n times, give or take)

If you try to calculate fib(1000) or something, you might overflow the stack.