Question

program - :fibbonacci series by using recursion ​

Answer 1

Please mark it as Brainliest

Fibonacci series program in C

#include <stdio.h>

int main()

{

int n, first = 0, second = 1, next, c;

printf("Enter the number of terms\n");

scanf("%d", &n);

printf("First %d terms of Fibonacci series are:\n", n);

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

{

if (c <= 1)

next = c;

else

{

next = first + second;

first = second;

second = next;

}

printf("%d\n", next);

}

return 0;

}

Answer 2

Answer:

class FibonacciExample2{

static int n1=0,n2=1,n3=0;

static void printFibonacci(int count){

if(count>0){

n3 = n1 + n2;

n1 = n2;

n2 = n3;

System.out.print