5.txt

Data Structure Question

n的阶乘

//n的阶乘
#include <iostream.h>
#include <conio.h>
float f(int);
float f1(int);
void main()
{
    int n;
cout<<"Input n:";
    cin>>n;
cout<<n<<"!="<<f(n)<<endl;
cout<<n<<"!="<<f1(n)<<endl;
getch();
}
float f(int n)
{
    if(n==1) return (1);
else return(f(n-1)*n);
}
float f1(int n)
{
    int i;
float fac;
fac=1;
for(i=1;i<=n;i++) fac=fac*i;
return (fac);
}