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 vote120 views1 answer
Android bottom navigation hiding views
Java
0 vote122 views1 answer
Android videoview not smooth for mp4
Java
1 vote113 views2 answers
How to do annotation configuration in spring
Java
1 vote125 views1 answer
How to test how many of one character is in a string java
Java
0 vote127 views1 answer
Java add xmlns attribute
Java
0 vote111 views1 answer
Conexion a mysql java
Java
3 votes121 views1 answer
Java 11 download 64 bit
Java
0 vote126 views1 answer
Comvertir a java
Java
8 votes124 views10 answers
Hi
Java
9 votes122 views2 answers
Input array through scanner in java
Java