forked from TheAlgorithms/Python
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpower_using_recursion.py
More file actions
Latest commit
36 lines (32 loc) · 1 KB
/
Copy pathpower_using_recursion.py
File metadata and controls
36 lines (32 loc) · 1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
"""
== Raise base to the power of exponent using recursion ==
Input -->
Enter the base: 3
Enter the exponent: 4
Output -->
3 to the power of 4 is 81
Input -->
Enter the base: 2
Enter the exponent: 0
Output -->
2 to the power of 0 is 1
"""
defpower(base: int, exponent: int) ->float:
"""
power(3, 4)
81
>>> power(2, 0)
1
>>> all(power(base, exponent) == pow(base, exponent)
... for base in range(-10, 10) for exponent in range(10))
True
"""
returnbase*power(base, (exponent-1)) ifexponentelse1
if__name__=="__main__":
print("Raise base to the power of exponent using recursion...")
base=int(input("Enter the base: ").strip())
exponent=int(input("Enter the exponent: ").strip())
result=power(base, abs(exponent))
ifexponent<0: # power() does not properly deal w/ negative exponents
result=1/result
print(f"{base} to the power of {exponent} is {result}")