recursive functions python code example

Example 1: recuursion python

# Reccursion in python 
def recursive_method(n):
    if n == 1:
        return 1 
    else:
        return n * recursive_method(n-1)
    # 5 * factorial_recursive(4)
    # 5 * 4 * factorial_recursive(3)
    # 5 * 4 * 3 * factorial_recursive(2)
    # 5 * 4 * 3 * 2 * factorial_recursive(1)
    # 5 * 4 * 3 * 2 * 1 = 120
num = int(input('enter num '))
print(recursive_method(num))

Example 2: recursion in python

def rec(num):
    if num <= 1:
        return 1
    else:
        return num + rec(num - 1)

print(rec(50))

Example 3: recursive function in python

def factorial(x):
    """This is a recursive function
    to find the factorial of an integer"""

    if x == 1:
        return 1
    else:
      	result = x * factorial(x-1)
        return ()


num = 3
print("The factorial of", num, "is", factorial(num))

Example 4: recursion in python

def yourFunction(arg):
    #you can't just recurse over and over, 
    #you have to have an ending condition
    if arg == 0:
        yourFunction(arg - 1)
        
    return arg

Example 5: recursion in python

houses = ["Eric's house", "Kenny's house", "Kyle's house", "Stan's house"]

# Each function call represents an elf doing his work 
def deliver_presents_recursively(houses):
    # Worker elf doing his work
    if len(houses) == 1:
        house = houses[0]
        print("Delivering presents to", house)

    # Manager elf doing his work
    else:
        mid = len(houses) // 2
        first_half = houses[:mid]
        second_half = houses[mid:]

        # Divides his work among two elves
        deliver_presents_recursively(first_half)
        deliver_presents_recursively(second_half)

Example 6: recursion python examples

void A(n){
    if(n>1) // Anchor condition
    {
       return A(n-1);
    }
}