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

7 votes207 views2 answers
Java console text color
Java
4 votes167 views4 answers
Do() java
Java
1 vote208 views2 answers
Java compare char
Java
2 votes216 views1 answer
Intellij run java file
Java
0 vote210 views2 answers
Get week number from localdate java
Java
0 vote209 views1 answer
Can a java class have more than 108 constructors
Java
0 vote236 views1 answer
How to use double in insert data programming in java
Java
2 votes226 views2 answers
Get year month day from date string java
Java
3 votes199 views1 answer
Fibunacci java
Java
6 votes224 views1 answer
Seconds to hours java
Java