forked from TheAlgorithms/Python
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbinary_exponentiation.py
61 lines (40 loc) · 923 Bytes
/
binary_exponentiation.py
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
"""Binary Exponentiation."""
# Author : Junth Basnet
# Time Complexity : O(logn)
def binary_exponentiation(a: int, n: int) -> int:
"""
>>> binary_exponentiation(1, 1)
1
>>> binary_exponentiation(2, 1)
2
>>> binary_exponentiation(3, 1)
3
>>> binary_exponentiation(4, 1)
4
>>> binary_exponentiation(1, 2)
1
>>> binary_exponentiation(2, 2)
4
>>> binary_exponentiation(3, 2)
9
>>> binary_exponentiation(4, 2)
16
>>> binary_exponentiation(1, 3)
1
>>> binary_exponentiation(2, 3)
8
>>> binary_exponentiation(3, 3)
27
>>> binary_exponentiation(4, 3)
64
"""
if n == 0:
return 1
elif n % 2 == 1:
return binary_exponentiation(a, n - 1) * a
else:
b = binary_exponentiation(a, n // 2)
return b * b
if __name__ == "__main__":
import doctest
doctest.testmod()