递归和非递归分别实现求n的阶乘

#include
#include
int factorial(int n)
{
    if (n == 1)
    {
        return 1;
    }
    else if (n > 1)
    {
        n--;
        return (n + 1)*factorial(n);
    }
}

int main()
{
    int num = 4;
    printf("%d的阶乘=%d\n", num, factorial(num));
    system("pause");
    return 0;
}

#include
#include
int jiecheng(int n)
{
    int i = 0;
    int count = 1;
    for (i = 0; i < n; i++)
    {
        count = count*(n - i);
    }
    return count;
}

int main()
{
    int num = 4;
    printf("%d的阶乘=%d\n", num, jiecheng(num));
    system("pause");
    return 0;
}
#include 

void print(int n)
{
    if (n>9)
    {
        print(n / 10);
    }
    printf("%d ", n % 10);
}

int main()
{
    print(1234);
    system("pause");
    return 0;
}

运行结果如下：