题目:
用递归实现x的n次方
实现代码:
#include <iostream>
using namespace std;
#define MaxSize 100
int recall(int x, int n)
{
if (n == 1)
return x;
else
return x * recall(x, n - 1);
}
int main()
{
int x = 3, n = 3;
cout << "3^3=" << recall(x, n);
cout<<endl;
}