Fibbomacci series using recursion shell programming?

Answer 1

Here is a good answer for recursion Fibonacci series.

#include <stdio.h>

#include <conio.h>

long Fibonacci(long n);

int main()

{

long r, n,i;

printf("Enter the value of n: ");

scanf("%ld",&n);

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

{

printf(" Fibonacci(%ld)= %ld\n", i,Fibonacci(i));

}

getch();

return 0;

}

long Fibonacci(long n)

{

if(n==0 n==1)

return n;

else

{

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

}

}

for n=5;

Output: Fibonacci(0)=0

Fibonacci(1)=1

Fibonacci(2)=1

Fibonacci(3)=2

Fibonacci(4)=3

Fibonacci(5)=5