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

-1 vote165 views1 answer
Round off and round up
Java
6 votes144 views1 answer
How to close a jframe in java with an if statement
Java
2 votes136 views1 answer
Information Dialog in JavaFX
Java
0 vote142 views1 answer
Como pegar o valor de um campo de texto swing
Java
0 vote142 views1 answer
Java enum get first element
Java
9 votes152 views4 answers
How to wait time in java
Java
0 vote152 views1 answer
Database springboot
Java Spring
0 vote158 views1 answer
Matrix multiplication in java
Java
0 vote141 views1 answer
Algorithms - decision
Java
0 vote130 views1 answer
Get current unix timestamp java
Java