Write a program to do a Implement pow(x, n), which calculates x raised to the power n (x^n).

The problem is classic example of recursion. Here it is important to understand the range of n. For this case we will consider n can be positive or negative

public double myPow(double x, int n) {
	if (n == 0)
		return 1;
	double temp = myPow(x, n / 2);
	if (n % 2 == 0)
		return temp * temp;
	else if (n > 0) {
		return x * temp * temp;
	} else {
		return (temp * temp) / x;
	}
}