MCPcopy Create free account
hub / github.com/TheAlgorithms/Go / RecursivePower1

Function RecursivePower1

math/power/fastexponent.go:30–38  ·  view source on GitHub ↗

RecursivePower1 is recursive O(n) function for pow(x, y)

(n uint, power uint)

Source from the content-addressed store, hash-verified

28
29// RecursivePower1 is recursive O(n) function for pow(x, y)
30func RecursivePower1(n uint, power uint) uint {
31 if power == 0 {
32 return 1
33 } else if power%2 == 0 {
34 return RecursivePower1(n, power/2) * RecursivePower1(n, power/2)
35 } else {
36 return n * RecursivePower1(n, power/2) * RecursivePower1(n, power/2)
37 }
38}

Callers 2

TestRecursivePower1Function · 0.85
BenchmarkRecursivePower1Function · 0.85

Calls

no outgoing calls

Tested by 2

TestRecursivePower1Function · 0.68
BenchmarkRecursivePower1Function · 0.68