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 vote135 views1 answer
How to translate java swing
Java
2 votes123 views1 answer
Appcompatdelegate.setdefaultnightmode(appcompatdelegate.mode_night_yes) not working
Java
0 vote134 views2 answers
Kotlin dependency injection
Java
1 vote132 views1 answer
Java hash password
Java
1 vote189 views1 answer
Execute application jar
Java
1 vote111 views1 answer
Define an array of size n in java
Java
3 votes116 views2 answers
Java sout
Java
0 vote158 views1 answer
What went wrong: Execution failed for task ':app:processDebugMainManifest'. > Unable to make field private final java.lang.String java.io.File.path accessible: module java.base does not "opens java.io" to unnamed module @1ce90e66
Java
0 vote121 views1 answer
Java init arraylist string
Java
0 vote121 views1 answer
BodyContentImpl memory leak
Java