A program to print Fibonacci series using recursion.

• Define a recursive function that takes an integer n as input

• Base case: if n is 0 or 1, return n

• Recursive case: return the sum of the previous two Fi...read more

#include<stdio.h>

int Fibonacci(int);

int main()

{

int n, i = 0, c;

scanf("%d",&n);

printf("Fibonacci series\n");

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

{

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

i++;

}

return 0;

}

int...read more

#include <stdio.h>

#include "stdio.h"

int fib (int x);

int main ()

{

int x;

scanf("%d",&x);

for (int i =0; i <x;i++)

{

printf ("%d",i);

}

return 0 ;

}

int fib (int x)

{

if (x ==...read more