Functions that call themselves are known as recursive functions. There are two parts to it: the base case and the recursive case. The base case is the situation that will bring the recursion to an end. The section of the function that calls on itself is called the recursive case. By using the recursion concept we have executed the fibonacci series in python using recursion function

The Fibonacci sequence is a set of numbers in which each successive number is the sum of the two preceding numbers. The series begins at 0 and 1 and continues indefinitely: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on. A mathematical equation can be used to describe the Fibonacci sequence: Xn+2= Xn+1 + Xn.

```
def Fibonacci(n):
if n<= 0:
print("Wrong Input Value")
elif n == 1:
return 0
elif n == 2:
return 1
else:
return Fibonacci(n-1)+Fibonacci(n-2)
print(Fibonacci(5))
```

Output:

3

Python Program to Find Prime Numbers Between a Given Range

Python Program to Calculate Area of Circle Using Function

Python Program to Calculate Compound Interest

Program to Find Simple Interest in Python

Maximum of Two Numbers in Python Using Function

C Program to Find Armstrong Number Using Recursion

Reverse a Number in C Using While Loop

Palindrome Program in C Using While Loop

Fibonacci Series in C Using For Loop Explanation