C PRIMER PLUS(第六版编程练习)9.11编程练习_9题

/*
使用递归函数重写编程练习8。
#include<stdio.h>
double power(double n, int p);
int main(void)
{
	double x, xpow;
	int exp;
	printf("Enter an number and the positive integer power");
	printf("to which \nthe number will be raised .Enter q");
	printf("to quit.\n");
	while (scanf("%lf%d", &x, &exp) == 2)
	{
		xpow = power(x, exp);
		printf("%.3g to the power %d is  %.5g\n ", x, exp, xpow);
		printf("Enter next pair of number or q to quit.\n");
	}
	printf("Hope you enjoyed this power trip --bye!\n");
	return 0;
}
double power(double n, int p)
{
	double pow;
	int i;
	if (p >= 0)
	{
		if (p == 0)
			pow = 1;
		if (n == 0 && p != 0)
			pow = 0;
		pow = 1;

		for (i = 1; i <= p; i++)
			pow *= n;
	}else if (p < 0)
	{
		pow = 1;
		for (i = 1; i <= -p; i++)
			pow *= n;
		pow = (double)(1 / pow);
	}
	return pow;
}
*/
#include<stdio.h>
double power(double n, int p);
int main(void)
{
	double x, xpow;
	int exp;
	printf("Enter an number and the positive integer power");
	printf("to which \nthe number will be raised .Enter q");
	printf("to quit.\n");
	while (scanf("%lf%d", &x, &exp) == 2)
	{
		xpow = power(x, exp);
		printf("%.3g to the power %d is  %.5g\n ", x, exp, xpow);
		printf("Enter next pair of number or q to quit.\n");
	}
	printf("Hope you enjoyed this power trip --bye!\n");
	return 0;
}
double power(double n, int p)
{
	double pow;
	
	if (p > 0)
	{
		pow = n * power(n, p - 1);
	}
	else if (p < 0)
	{
		pow = (1/n ) * (1 / power(n, -p - 1));
	}
	else
		pow = 1;
	return pow;
}

这个递归很符合人的逻辑,看了下代码的运行,一脸蒙蔽。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值