Python Program to Find Factorial of Number Using Recursion

Spread the love

The factorial function is a foundational concept in mathematics and computer science. It is used in many applications such as combinatorial mathematics, probability theory, and computational algorithms. In this extensive article, we will explore how to calculate the factorial of a number using recursion in Python, along with the mathematical background, performance considerations, and optimizations.


Factorial is a mathematical operation that multiplies a given number n by every natural number less than itself down to 1. The factorial of n is denoted as n!

Understanding Factorial

The factorial function is defined as follows:

Additionally, 0!=1 by definition.

Mathematical Background

The factorial function has an inherent recursive nature, which can be expressed as:

Here, (n−1)! is also a factorial, which is calculated in the same way. This makes the problem well-suited for a recursive solution.

Why Recursion?

Recursion provides a simple and clean approach to solve problems that can be broken down into smaller, similar problems. The recursive nature of the factorial function naturally aligns with this programming paradigm, making it an excellent example for learning recursion.

The Recursive Algorithm

Here’s how you can write a Python function to calculate factorial using recursion:

def factorial(n):
    if n == 0:
        return 1
        return n * factorial(n-1)

# Example usage
print(factorial(5))  # Output will be 120 (5 * 4 * 3 * 2 * 1)

Performance Considerations

Time Complexity

The time complexity of the above recursive algorithm is O(n). This is because each function call performs a constant amount of work, and we make n recursive calls.

Memory Usage

The memory used by this algorithm is also O(n) due to the stack space required to maintain n recursive calls. For large values of n, this could result in a stack overflow.


Though recursion provides an elegant solution, it’s not always the most efficient. Some optimizations include:

  • Tail Recursion: Python doesn’t optimize tail recursion. However, tail recursive algorithms are generally more stack-efficient.
  • Memoization: This involves saving previously computed results to avoid redundant calculations. Memoization can bring down the effective time complexity but is generally not used for simple problems like factorial calculation.


Finding the factorial of a number using recursion in Python is both instructional and straightforward. While the naive recursive algorithm is easy to implement and understand, it’s important to consider its limitations in terms of time complexity and stack space, especially for large values of nn. Understanding these aspects not only makes you proficient in the use of recursion but also equips you to make informed choices between different algorithmic approaches.

Leave a Reply