2.1 设计求 factorial(n)的递归算法

# include <iostream>
# include <iomanip>
using namespace std;
int factorial(int n);
int main()
{
    int n;
    cin >> n;
    cout << " factorial of n = " << factorial(n) << endl;
    return 0;
}
int factorial(int n)
{
    if (n == 1){
        return 1 ;
    }else{
        return factorial(n-1)*n ;
    }
}