Oli Eugenio OEUG99

## Stairway-Problem-Recursive-Solution.py
def num_paths(n):
    """
    A function to calculate the number of different paths up a flight of stairs that has n-steps, if you can only move
        1,2,3 steps at a time.
    """

    # Base cases:
    if n < 0:
        return 0
    if n == 1:

## 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]))
	def num_paths(n):
	"""
	A function to calculate the number of different paths up a flight of stairs that has n-steps, if you can only move
	1,2,3 steps at a time.
	"""

	# Base cases:
	if n < 0:
	return 0
	if n == 1:
	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]))