10000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a632c74 commit aef86a8Copy full SHA for aef86a8
algorithms/recursion/exponentiation.py
@@ -0,0 +1,18 @@
1
+
2
+def exponentiation(baseNumber, power):
3
+ answer = None
4
5
+ if power == 1:
6
+ answer = baseNumber
7
8
+ elif power == 2:
9
+ answer = baseNumber * baseNumber
10
11
+ else:
12
+ halfAnswer = exponentiation(baseNumber, power//2)
13
+ answer = halfAnswer * halfAnswer
14
15
+ if power%2 == 1:
16
+ answer *= baseNumber
17
18
+ return answer
0 commit comments