MTH225-Sept25.py

# Recursive functions for MTH 225 9/25/2023

# Input is a positive integer
def A(n): 
    if n == 1: 
        return n
    else:
        return n + A(n-1) 
      
# Input is a positive integer
def B(n): 
    if n == 0: 
        return 1
    else:
        return 2*B(n-1)

# Input is a list of integers  
def C(my_list):
    if my_list == [ ]: 
        return 0
    else: 
        return min(my_list[-1], C(my_list.pop()))
    
# min(a,b) returns the smaller of a and b 
# my_list[-1] is the last element of my_list
# my_list.pop() removes the last element of my_list