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 vote105 views1 answer
What does setFocusable do in java
Java
1 vote118 views1 answer
Shutdown batch file windows 10
Java
0 vote130 views2 answers
Auto in java
Java
0 vote106 views1 answer
Hanoï recursive algorithm
Java
2 votes108 views1 answer
Zufallszahlen in java
Java
0 vote107 views2 answers
&& vs & in java
Java
1 vote112 views1 answer
Java Scrip
Java
0 vote91 views2 answers
How to remove null values collections
Java
-1 vote107 views2 answers
How to change java version in pom.xml
Java
3 votes138 views1 answer
Java list size
Java