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

3 votes263 views6 answers
How to change the value of an arraylist in java
Java
3 votes223 views2 answers
Processing load font from file
Java
0 vote275 views1 answer
Bakht k takht sy yaklakht utara hwa shaks tuny dekha hai kbi jeet k hara hwa shaks in urdu
Java
1 vote265 views1 answer
How to create a circle in java
Java
-3 votes266 views2 answers
Java define a generic class that produces
Java
0 vote251 views1 answer
Google intent for directions
Java
6 votes277 views3 answers
Lombok maven plugin
Java
5 votes267 views1 answer
How to get an array as input in java
Java
8 votes256 views2 answers
Java first letter to upper case
Java
4 votes256 views1 answer
How to call a function in java
Java