Some recursive algorithms in python

factorial.py

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

fibonacci.py

def fibonacci(n):
  """
  Returns the n-th element of the fibonacci sequence
  """
  if n == 1:
    return 1
  elif n == 2:
    return 2
  elif n > 2:
    return fibonacci(n - 1) + fibonacci(n - 2)