Ip07.py
''' 
Soren DeOrlow 
IDSN 599, Fall 2021 
deorlow@usc.edu 
Lab practical 7 
'''

#create a sumdigits function that recurscively sums the digits of an integer and returnns the results
def sumDigits(userUnit):
    if len(userUnit) == 0: #base case is empty
        return 0
    return int(userUnit[0]) + sumDigits(userUnit[1:])

def sumDigits(userUnitA):
    if len(userUnitA) == 0: #base case is empty
        return 0
    return int(userUnitA[0]) + sumDigits(userUnitA[1:])

def sumDigits(userUnitB):
    if len(userUnitB) == 0: #base case is empty
        return 0
    return int(userUnitB[0]) + sumDigits(userUnitB[1:])

#Accept two int variables and return the greatest commen denominator
def getGCD(unitA, unitB):
    if unitA % unitB == 0: #base case is empty
        return unitB
    return getGCD(unitB, unitA % unitB)

def main():
    #recursion simplifies to base case

    unitA = int(input("Please enter your 1st positive number: "))
    unitB = int(input("Please enter your 2nd positive number: "))
    userUnitA = str(unitA)
    userUnitB = str(unitB)
    userUnit = (userUnitA + userUnitB)

    print("")
    print("The greatest common denominator of your input is: ", getGCD(unitA, unitB))
    print("The sum of the units within your first input amounts to: ", sumDigits(userUnitA))
    print("The sum of the units within your second input amounts to: ", sumDigits(userUnitB))
    print("The sum of all your inputs amounts to: ", sumDigits(userUnit))


main()

''' 
#create a sumdigits function that recurscively sums the digits of an integer and returnns the results 
def sumDigits(userUnit): 
    if len(userUnit) == 0: #base case is empty 
        return 0 
    return int(userUnit[0]) + sumDigits(userUnit[1:]) 
 
def main(): 
    userUnit = input("Please enter a positive integer: ") 
    print(sumDigits(userUnit)) 
 
#Accept two int variables and return the greatest commen denominator 
def getGCD(unitA, unitB): 
    if unitA % unitB == 0: #base case is empty 
        return unitB 
    return getGCD(unitB, unitA % unitB) 
 
def main(): 
    #recursion simplifies to base case 
    unitA = int(input("Please enter your 1st positive number: ")) 
    unitB = int(input("Please enter your 2nd positive number: ")) 
    print(getGCD(unitA, unitB)) 
 
main() 
'''