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

2 votes301 views1 answer
Jpql spring boot
Java
3 votes302 views1 answer
How to make background image transparent in android studio
Java
0 vote296 views2 answers
Kotlin dependency injection
Java
-2 votes301 views1 answer
Kotlin get current date
Java
0 vote324 views1 answer
Kotlin const to Java
Java
0 vote294 views1 answer
Connecting to h2 database from java
Java
8 votes298 views4 answers
Char to ascii java
Java
0 vote287 views1 answer
Processing - Save n number of frames
Java
30 votes290 views6 answers
Retrofit android
Java
1 vote314 views1 answer
Online java code fixer
Java