Breaking News: Grepper is joining You.com. Read the official announcement!

java binary exponentiation

Efton answered on June 16, 2020 Popularity 8/10 Helpfulness 2/10

answer java binary exponentiation

java binary exponentiation

Comment

/**
* 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);
}

Popularity 8/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: binary exponentiation java

Link to this answer
Share Copy Link

Contributed on Jun 16 2020

Efton

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

java binary exponentiation

Contents

More Related Answers

java binary exponentiation

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.