Breaking News: Grepper is joining You.com. Read the official announcement!

Problem 2 : The series 0, 1, 1, 2, 3, 5, 8, 13, ... is called the Fibonacci series. Here, termn=termn-1 + termn-2, for n>1, term0 = 0, term1 = 1. Write a program that finds the sum of first n terms of the series using recursion.

DM Lesar answered on November 23, 2022 Popularity 1/10 Helpfulness 1/10

answer Problem 2 : The series 0, 1, 1, 2, 3, 5, 8, 13, ... is called the Fibonacci series. Here, termn=termn-1 + termn-2, for n>1, term0 = 0, term1 = 1. Write a program that finds the sum of first n terms of the series using recursion.

Problem 2 : The series 0, 1, 1, 2, 3, 5, 8, 13, ... is called the Fibonacci series. Here, termn=termn-1 + termn-2, for n>1, term0 = 0, term1 = 1. Write a program that finds the sum of first n terms of the series using recursion.

Comment

#include<stdio.h>

int fibonacci(int num){
    if(num == 0 || num == 1)
        return num;
    else
        return(fibonacci(num-1) + fibonacci(num-2));
}
int main(){
    int num, count= 0;
    printf("Enter Total Fibonacci Numbers:: ");
    scanf("%d", &num);
    printf("Fibonacci number of series:: ");
    
    for(int i = 1; i <= num; i++){
        printf("%d ", fibonacci(count));
        count++;
    }
    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language c

Source: Grepper

Tags: c fibonacci n series sum using

Link to this answer
Share Copy Link

Contributed on Nov 23 2022

DM Lesar

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Problem 2 : The series 0, 1, 1, 2, 3, 5, 8, 13, ... is called the Fibonacci series. Here, termn=termn-1 + termn-2, for n>1, term0 = 0, term1 = 1. Write a program that finds the sum of first n terms of the series using recursion.

Contents

More Related Answers

Problem 2 : The series 0, 1, 1, 2, 3, 5, 8, 13, ... is called the Fibonacci series. Here, termn=termn-1 + termn-2, for n>1, term0 = 0, term1 = 1. Write a program that finds the sum of first n terms of the series using recursion.

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.