Rewrite the recursive pow method from Figure 8.11 so that the time to compute pow(x, n) is log(n). 

Transcribed Image Text:

FIGURE 8.11 Altemative Implementation of a Method to Compute Powers Implementation public static double pow(double x, int n) if (x == 0 && n <= 0) throw new IllegalArgumentException("x is zero and n=" + n); else if (x == 0) %=33D return 0; else if (n return 1; else if (n > 0) return x * pow(x, n-1); else // x is nonzero, and n is negative. return 1/pow (x, -n); 0) == }