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

10 votes287 views2 answers
Java string to boolean
Java
4 votes288 views5 answers
How to use while loop in java
Java
0 vote284 views1 answer
Rock paper scissors java
Java
1 vote236 views2 answers
Javafx event resize
Java
0 vote290 views1 answer
Java windowbuilder multiple monitors windowed mode
Java
0 vote265 views1 answer
Ignore sonarlint line java
Java
0 vote274 views1 answer
Java tester si un caractere est une lettre
Java
1 vote288 views1 answer
How to find the class of an object java
Java
56 votes274 views6 answers
String remove last character
Java
9 votes309 views2 answers
Android glide dependency
Java