Java binary exponentiation

/**
* Calculate a^n in O(logn) time, instead of O(n) time with naive approach.
**/
public static long powerRecursive(int base, int exponent){
  if(exponent == 0) return 1;
  return (exponent % 2 == 0) ?
    powerRecursive(base, exponent / 2) * powerRecursive(base, exponent / 2)
    : base * powerRecursive(base, (exponent - 1) / 2) *
      powerRecursive(base, (exponent - 1) / 2);
}

Similar codes

0 vote169 views1 answer
Convert character digit to int java
Java
0 vote153 views1 answer
Slice() in typesript
Java
0 vote144 views1 answer
Java iterator hasNext and next
Java
0 vote146 views1 answer
How to install java on ubuntu 18.0.4
Java
0 vote169 views1 answer
Java remove n from string
Java
0 vote112 views1 answer
Unmodifiable list java
Java
10 votes149 views5 answers
Array average
Java
0 vote154 views1 answer
Java first character string number
Java
0 vote135 views1 answer
Leak canary
Java
2 votes155 views2 answers
Changer version java terminal
Java