Answer to Question #177743 in Algorithms for Glenn

Question

Write an algorithm that takes the positive integer ‘n’ as input and returns the exponent 2^n as output. Analyze the time complexity of the algorithm using program step table method.

Answer 1

n=input("Enter positive integer")
b=n^2
print(b)

Find time complexity:

$$O(n)=3$$

because the algorithm has three steps.