Exercise 10-3 recursive implementation of exponential functions

exercises 10-3 Recursive implementation of exponential function (15 branch )

This problem requires the realization of a calculation xn（n≥1） Function of .

Function interface definition ：

double calc_pow( double x, int n );

function calc_pow Should return x Of n The value of the power . It is suggested to use recursion to realize . The problem is to ensure that the results are within the double precision range .

Sample referee test procedure ：

#include <stdio.h>

double calc_pow( double x, int n );

int main()
{
    double x;
    int n;

    scanf("%lf %d", &x, &n);
    printf("%.0f\n", calc_pow(x, n));

    return 0;
}

/*  Your code will be embedded here  */

sample input ：

2 3

sample output ：

8

double calc_pow( double x, int n ){
    double s;
    if(n==0){
        s=1;
    }else{
        s=x*calc_pow(x,n-1);
    }
    return s;
}