Question

Hem 1 def expo(base, exponent): # Write your function here Python's pow function returns the result of raising a number to a given power. Define a function expo that performs this task, and state its computational complexity using big-o notation. The first argument of this function is the number, and the second argument is the exponent (nonnegative numbers only) 4 def main(): ***Tests with powers of 2.*** for exponent in range (5): print(exponent, expo(2, exponent)) 000 9 if _name__ == "__main_": main() You may use either a loop or a recursive function in your implementation. Caution: do not use Python's ** operator or pow function in this exercise!

Answer 1

def expo(base, exponent):
    """
    Time complexity of this function is O(n)
    """
    if exponent == 0:
        return 1
    else:
        return base * expo(base, exponent - 1)


def main():
    for exponent in range(5):
        print(exponent, expo(2, exponent))


if __name__ == '__main__':
    main()