Let us c Q.Write a recursive function to obtain the first 25 numbers of a Fibonacci sequence. In a Fibonacci sequence the sum of two successive terms gives the third term. Following are the first few terms of the Fibonacci sequence: 1 1 2 3 5 8 13 21 34 55 89 ........

CH-5J(c).c

/* fibonacci series*/
#include <stdio.h>

int fibonacci(int i);
int main()
{
    int temp;
    printf(" fibonacci seriese s=");
    for (int i = 1; i <= 25; i++)
    {
        temp = fibonacci(i);

        printf("%d ", temp);
    }
    printf(" ..........up to n term");
}

int fibonacci(int i)
{
    if (i == 0 || i == 1)
    {
        if (i == 0)
        {
            return 0;
        }
        else
            return 1;
    }
    else
        return fibonacci(i - 1) + fibonacci(i - 2);
}