We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 9640a40 commit 89a65a8Copy full SHA for 89a65a8
maths/binary_exponentiation.py
@@ -4,15 +4,15 @@
4
# Time Complexity : O(logn)
5
6
7
-def binary_exponentiation(a, n):
+def binary_exponentiation(a: int, n: int) -> int:
8
if n == 0:
9
return 1
10
11
elif n % 2 == 1:
12
return binary_exponentiation(a, n - 1) * a
13
14
else:
15
- b = binary_exponentiation(a, n / 2)
+ b = binary_exponentiation(a, n // 2)
16
return b * b
17
18
0 commit comments