阶乘

beyes

用递归的方法，实现一个简单的阶乘，求 4! 的结果：

#include <stdio.h>

int factorial (int j)
{
        int result;

        if (j == 0)
                return 1;

        result = j * factorial (j - 1);

        return result;
}

int main()
{
        int i;

        for (i = 0; i < 5; i++)
                printf ("%d! = %d\n", i, factorial (i));

        return (0);
}

运行与输出：

beyes@linux-beyes:~/C/structer/recursion> ./factorial.exe
0! = 1
1! = 1
2! = 2
3! = 6
4! = 24