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 vote284 views1 answer
Case sensitive in java
Java
106 votes324 views2 answers
Java gui
Java
6 votes275 views3 answers
Java get current time in seconds
Java
0 vote268 views1 answer
If statements not working java
Java
0 vote266 views1 answer
Set image programmatically android
Java
4 votes265 views5 answers
Java main method
Java
0 vote278 views1 answer
How to put string in char array in java tutorialspoint
Java
1 vote298 views1 answer
Java integer to binary string with leading zeros
Java
0 vote232 views1 answer
How to print a list in string form java
Java
2 votes287 views2 answers
Transpose of a matrix java
Java