//by canancat
//利用递归求阶乘,找到递归终结点
#include <iostream>
using namespace std;
unsigned fac(unsigned);
int main() {
unsigned int n,y;
cout<<"enter a positive integer : ";
cin>>n;
y=fac(n);
cout<<n<<"!="<<y<<endl;
return 0;
}
unsigned int fac(unsigned n){
unsigned f;
if(n==0) f=1;//设置递归终结点
else f=fac(n-1)*n;//递归经常采用else进行
return f;
}
递归--求阶乘
最新推荐文章于 2024-07-19 15:39:46 发布