p243 第八题

/*在第六章“C控制语句：循环”的程序清单6.20中，函数power()的功能是返回一个double类型数的某个正整数次幂，现在改进该函数，使其能正确地计算负幂，同时
，用该函数实现0的任何次幂为0，并且任意值的0次幂为1.使用循环的方法编写该函数并在一个程序中测试它。*/
//使用递归函数重做练习七 
//pewer.c---计算数值的整数次幂
///*
#include <stdio.h>


double power_positive (double n,int p);
double power_negative (double n,int p);


int main (void)
{
double x,xpow;
int exp;

printf ("Enter a number and an the interger number to which\n ");
printf ("the number will be raised . Enter q to quit\n");

while (scanf ("%lf %d",&x,&exp)==2)
{
if (x==0)
printf ("%lf to the power of %d is 0\n",x,exp);
else
{
if (exp==0)
printf ("%lf to the power of %d is 1\n",x,exp);
else if (exp>0)
{
//printf ("")
xpow= power_positive (x,exp);
printf ("%lf to the power of %d is %lf\n",x,exp,xpow);
}
else 
{
  xpow =power_negative (x,exp);
  printf ("%lf to the power of %d is %lf\n",x,exp,xpow);
}
}
printf ("Please enter next pair of numbers q to quit\n");
}
printf ("Hope you enjoyed this power trip ---BYE!\n");

return 0;
}


double power_positive (double n,int p)
{

double pow=1;
if (p>0)

pow=n*power_positive (n,(p-1));

return pow;
}


double power_negative (double n,int p)
{
double pow=1;
if (p==-1)
return 1/n;
// if (p<0)
   else
pow =(1/n)*power_negative (n,(p+1));
return pow;
}
/*




#include <stdio.h>


double power_positive(double n,int p);
double power_negative(double n,int p);


int main(void)
{
    double x,xpow;
    int exp;
    printf("Enter a number and the integer power to which\n");
    printf("the number will be raised.Enter q to quit.\n");
    while (scanf("%lf %d",&x,&exp)==2)
    {
        if (x==0)
            printf("%lf to the power of %d is 0.\n",x,exp);
        else
        {
            if (exp==0)
                printf("%lf to the power of %d is 1.\n",x,exp);
            else if (exp>0)
            {
                xpow=power_positive(x,exp);
                printf("%lf to the power of %d is %lf.\n",x,exp,xpow);
            }
            else
            {
                xpow=power_negative(x,exp);
                printf("%lf to the power of %d is %lf.\n",x,exp,xpow);
            }
        }
        printf("Enter next pair of numbers or q to quit.\n");
    }
    printf("Hope you enjoyed this power trip --BYE!\n");


    return 0;


}


double power_positive(double n,int p)
{
    double pow=1;
    if (p>0)
        pow=n*power_positive(n,(p-1));


    return pow;
}


double power_negative(double n,int p) //用递归实现 
{
    if (p==-1)return 1/n;
    else
        return (1/n)*power_negative(n,p+1);
}
*/