Python Program on Print Fibbonacci Series using Recursion

In this article, we will explore a Python program that generates the Fibonacci series up to a specified limit using recursion. The Fibonacci sequence is an ordered set of numbers, with each term being the summation of the two immediately preceding numbers, initially commencing from 0 and 1. This program demonstrates the concept of recursion and how it can be employed to calculate and display Fibonacci numbers.

Prerequisites

• Functions and their role in code organization.
• Recursion and its basic principles.
• Understanding and use of global variables.
• Proficiency in acquiring user input within Python programs.

Topic Explanation

This program centers on fibbo(n), using recursion to generate the Fibonacci series up to the nth term. Global variables ‘a’ and ‘b’ track series elements, and user input defines the series limit, invoking fibbo() to produce the series.

The program offers practical insights into recursion and global variables, enhancing comprehension. With user-defined limits and recursive methodology, it effectively demonstrates their role in solving mathematical problems, serving as an instructive hands-on exercise for readers.

Code:

# fibbonacci series 1 2 3 5 8 13 ......n using recursion

# Initializing the first two numbers of the Fibonacci series
a = 0
b = 1

# Defining the recursive function to generate Fibonacci series
def fibbo(n):
    global a, b
    
    # Base case: if n is 0, exit the recursion
    if n == 0:
        return
    else:
        # Calculate the next Fibonacci number
        c = a + b
        # Print the current Fibonacci number
        print(c, end=" ")
        
        # Update values of a and b
        a = b
        b = c
        
        # It Recursively calls the function 
        fibbo(n - 1)

# Taking user input for the limit of the Fibonacci series
n = int(input("Enter the limit: "))

# Calling the Fibonacci function with the user-specified limit
fibbo(n)