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.

Register to vote on and add code examples. Join our developer community to improve your dev skills and code like a boss!

No Good?

Help us improve our code examples by registering to vote on and add answers. Join our developer community to improve your dev skills and code like a boss!