# Exercise 4: Fibonacci Using Recursion

This exercise requires you to implement the Fibonacci series using recursion

## We'll cover the following

## Problem Statement

Previously you wrote the code for generating *Fibonacci* series. In this exercise, you have to implement *Fibonacci series* again but using **Recursion** instead.

You’re given the *function* `fibonacci`

that takes integer `n`

that tells the *range* up to which you want to calculate the series.

Now implement this logic using *recursion*.

Create a free account to access the full course.

By signing up, you agree to Educative's Terms of Service and Privacy Policy