Recursion in Python: A Complete Guide

Python function demonstrating multiplication through iterative addition

Explanation

• The function multiply() implements multiplication using repeated addition instead of the standard multiplication operator
• It initializes a result variable to zero and then adds the first parameter 'a' to itself 'b' times using a for loop
• The loop iterates 'b' times, with each iteration adding 'a' to the running total stored in result
• The final accumulated sum is printed to display the multiplication result of the two input parameters
• When called with multiply(3,4), it calculates 3+3+3+3=12 and outputs the result 12

Output

Recursive multiplication function implementation using repeated addition

Explanation

• The function implements multiplication through recursive addition by repeatedly adding the first number to itself
• Base case occurs when the second parameter equals 1, returning the first parameter directly
• For all other cases, the function adds the first number to the result of calling itself with decremented second parameter
• This approach demonstrates how multiplication can be conceptually understood as repeated addition
• The final output displays 30 when multiplying 5 by 6 through this recursive process

Output

This code defines a recursive function to calculate the factorial of a given number.

Explanation

• The function fact takes a single argument number and checks if it is equal to 1.
• If number is 1, it returns 1, which is the base case for the recursion.
• If number is greater than 1, it recursively calls itself with number - 1 and multiplies the result by number.
• The final line prints the factorial of 5 by calling fact(5), which computes 5! (5 factorial).
• This implementation demonstrates the concept of recursion, where a function calls itself to solve smaller instances of the same problem.

Output

This code defines a recursive function to check if a string is a palindrome.

Explanation

• The function palin takes a string text as input and checks its length.
• If the length is 1 or less, it prints 'Palindrome' since single characters and empty strings are palindromes.
• If the first and last characters of the string are the same, it recursively calls itself with the substring that excludes these characters.
• If the first and last characters do not match, it prints 'Not a Palindrome'.
• The function is tested with various strings to demonstrate its functionality.

Output

Recursive Fibonacci sequence calculation function implementation

Explanation

• The function implements a recursive approach to calculate Fibonacci numbers where each number equals the sum of the two preceding ones
• Base cases are defined for months 0 and 1, both returning 1 as the initial values in the Fibonacci sequence
• The recursive calls break down the problem by calling itself with reduced month values until reaching the base cases
• The function demonstrates the classic mathematical definition F(n) = F(n-1) + F(n-2) with proper termination conditions
• When executed with input 5, the function returns 8, representing the 5th Fibonacci number in the sequence

Output

Recursive Fibonacci implementation with memoization optimization for efficient computation

Explanation

• The function implements a recursive approach to calculate Fibonacci numbers while storing previously computed values in a dictionary to avoid redundant calculations
• It uses a base case dictionary initialized with {0:1, 1:1} to handle the first two Fibonacci numbers
• When calculating memo(48, d), the function recursively computes fib(47) and fib(46) by referencing stored values in the dictionary
• The memoization technique dramatically improves performance by reducing time complexity from exponential to linear
• The final result represents the 48th Fibonacci number calculated efficiently through cached intermediate results

Output

Next in this series: Python Functions Interview Questions: Decorators & Closures →