示例: 使用递归对计算机进行编程
#include <iostream> using namespace std; int calculatePower(int, int); int main() { int base, powerRaised, result; cout << "Enter base number: "; cin >> base; cout << "Enter power number(positive integer): "; cin >> powerRaised; result = calculatePower(base, powerRaised); cout << base << "^" << powerRaised << " = " << result; return 0; } int calculatePower(int base, int powerRaised) { if (powerRaised != 0) return (base*calculatePower(base, powerRaised-1)); else return 1; }
输出
Enter base number: 3 Enter power number(positive integer): 4 3^4 = 81
此技术只能在指数为正整数时计算幂。
要计算任何数字的幂，您可以使用
pow() 函数。
result = pow(base, exponent);
