Certainly! Recursion can be implemented in various programming languages. Here's an example of a recursive function in Python that calculates the factorial of a number:

pythonCopy code

def factorial(n):    # Base case: factorial of 0 is 1    if n == 0:        return 1        # Recursive case: factorial of n is n multiplied by factorial of (n-1)    return n * factorial(n - 1)

This factorial function uses recursion to calculate the factorial of a given number. It follows the two essential steps of recursion: a base case to terminate the recursion, and a recursive case to break down the problem into smaller subproblems.

Let's test the factorial function by calling it with different inputs:

pythonCopy code

print(factorial(0))  # Output: 1 print(factorial(5))  # Output: 120 print(factorial(10)) # Output: 3628800

The factorial function recursively calls itself with a reduced value of n until it reaches the base case of n == 0, where it returns 1. Then, as the recursive calls unwind, the results are multiplied together to obtain the final factorial value.

Recursion can be a powerful technique, but it's important to ensure that the base case is properly defined and that the recursion terminates. Otherwise, it can lead to infinite recursion and stack overflow errors.