Question

Use a recursive function to find the Fibonacci series.

Answer 1

Answer:

Fibonacci series using recursion inC 1.#include<stdio.h>

2.int Fibonacci(int);

3.int main()

4.int n, i = 0, c;

5.scanf("%d",&n);

6.printf("Fibonacci series\n");

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

Explanation:

That's your answer.

Hope this helps.

Mark me as brainliest.

Thank you.

Answer 2

$\textsf{\large Recursive function for the N^{th} term of Fibonacci series}$

    $\texttt{int fibonacci(int n) \{}\\ \texttt{\hspace{2em} if (n < 2) return n;}\\\texttt{\hspace{2em} return fibonacci(n - 1) + fibonacci(n - 2);}\\\texttt{\}}$

$\textsf{Similar question - }$

    https://brainly.in/question/37556029