Fibonacci series program in python using recursive method

In this tutorial we are going to learn how to print Fibonacci series in python program using recursion.

In this series number of elements of the series is depends upon the input of users. Program will print n number of elements in a series which is given by the user as a input.

Before moving directly on the writing Fibonacci series in python program, first you should know

A Fibonacci series is a series in which next number is a sum of previous two numbers.

 

For example : 0, 1, 1, 2, 3, 5, 8 ……

In Fibonacci Series, first number starts with 0 and second is with 1 and then its grow like,

0

1

0 + 1 = 1

1 + 1 = 2

1 + 2 = 3

2 + 3 = 5 and 

so on…

How our program will behave?

Its Logic is different from Fibonacci series program in c using iterative method.

Here we have a function named fibonacci() which will take a input and then return element. Each time it will call itself to calculate the elements of the series. 

Like if someone given 6 as a input then our program should return,

0, 1, 1, 2, 3, 5

Python program to print Fibonacci series using recursive methods

first,second=0,1
n = int(input("please give a number for fibonacci series : "))
def fibonacci(num):
    if num == 0:
        return 0
    elif num == 1:
        return 1
    else:
        return fibonacci(num-1)+fibonacci(num-2)
print("fibonacci series are : ")
for i in range(0,n):
    print(fibonacci(i))
 

Output:

fibonacci series in python using recursive method

Leave a Comment