Question

c programming (fibonacci series)
can someone show me the source code for recursion in fibonacci series.
my logic is :
sum=first+second;
second=sum;
first=second;
also show in reverse order

Answer 1

Khan Academy is probably more useful than OpenStudy when it comes to programming. http://www.youtube.com/watch?v=kNT5pAyUeqE

Answer 2

This will compute the fib of any value (val):

int fib(int val){
if(val == 0)
return 0;
else if(val == 1)
return 1;
return fib(val-1) + fib(val-2);
}

Answer 3

@DangerousJesse I would not say KA is good for C.

Answer 4

a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc.
i too suggest you to refer Khan Academy.