Write any recursive function to generate the fibonacci series.?

Answer 1

http://www.imada.sdu.dk/~svalle/courses/dm14-2005/mirror/c/subsection3_4_6.html#SECTION0004600000000000000

Answer 2

abhay

For example, here's a simple rule for generating the triangular numbers:

def tri(n):
# triangular num n
# = sum of n consecutive counting nos (n>=1)
if n<=1: return n
else: return n + tri(n-1)

A canonical example of recursion is the computation of Fibonacci numbers:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946 ...

This sequence can be defined recursively as follows (F(n) is the nth Fibonacci number):

* if n = 0, F(n)= 0
* if n = 1, F(n) = 1
* otherwise, F(n) = F(n - 1) + F(n - 2)

You can easily follow this definition and generate some Fibonacci numbers for yourself - you will get precisely the sequence given above.

Here is the C++ code that returns any Fibonacci number (constrained by execution-time and limitations of the C++ long type):

long fib_rec( long index )
{
if (index < 2)
return index;
else
return fib_rec(index - 1) + fib_rec(index - 2);
}

try reading this and learn

http://isg.cs.tcd.ie/giangt/recursion.pdf
http://theory.cs.uvic.ca/amof/e_fiboI.htm
http://www.math.sunysb.edu/~scott/Book331/Recursion_making_Koch.html
http://www.thescripts.com/forum/thread565938.html

Answer 3

And why exactly a recursive function? Why not a couple of simple loops instead?
Are you posting all your homework questions here, dear? :-)

Answer 4

// to generate fibonacci series using recursive function
void main()
{
int fib(int);
inta=0,temp,n;
cout< cout< cin>>n;
for(i=1,i<=n-1,i++)
{temp=fib(i);
cout< }
getch();
}
int fib (intn)
{if(m==1||m==2)
return 1;
else
return fib (m-1)+fib(m-2);
}




if you have any problum regarding c++ contact me on [e-mail]

Answer 5

wat the hell u r asking, very easy one.
u can't do it?
check out book dude.