Using recursion to implement mathematical inductive proofs.

RecursiveArraySum.py

def sum(array):
    # Base Case:
    if len(array) == 1:
        return array[0]
    # Inductive Step:
    return array[0] + sum(array[1:])
    
print(sum([1,2,3,4,5]))

RecursiveStringReverse.py

def reverse(string):
    # Base Case:
    if len(string) == 1:
        return string[0]
    # Inductive Step:
    return string[len(string) -1] + reverse(string[:len(string) - 1])
    
  print(reverse('hello world'))