c++ 递归计算x的y次幂
初——函数的递归学习
源代码如下:
#include "stdafx.h"
#include<iostream>
#include<math.h>
using namespace std;
double getPower(double x, int y)
{
if (y == 0)
return 1;
else
return getPower(x, y - 1)*x;
}
int _tmain(int argc, _TCHAR* argv[])
{
double x;
int y;
cout << "请按顺序依次输入x和y" << endl;
cin >> x >> y;
if (y < 0)
{
y = abs(y);
cout << "计算可得" << x << "的" << "-" << y << "次幂等于" << 1 / getPower(x, y) << endl;
}
else
cout << "计算可得" << x << "的" << y << "次幂等于" << getPower(x, y) << endl;
return 0;
}
测试运行结果如下: