C language function cyclic and recursive basic problems

The problem is to calculate n factorial using circular method and recursive method
My code:

#include<stdio.h>//n的阶乘//

int xh(int );
int dg(int );

int main()
{
    int a;
    scanf("%d",&a);
    printf("循环算法%d的阶乘=%d\n",a,xh(a));
    printf("递归算法%d的阶乘=%d\n",a,dg(a));
    return 0;
}

int xh(int n)
{
    int m=1;
    while(n>0)
    {
        
        m=m*n;
        n--;
    }
    return m;
}

int dg(int n)
{
    int m;
    if(n>0)
    {
        
        m=n*dg(n-1);
    }
    return m;
}

C language function cyclic and recursive basic problems

Good Question 0Comment Collection Report

0 Answer

skz385489 注册会员
2023-02-25 10:08

the reference answer GPT ᴼ ᴾ ᴱ ᴺ ᴬ ᴵ < br / > your recursive function dg, under the condition of no set n = 0 end have been proceed cause recursion, a compiler error.
can change the recursive function to:

int dg(int n)
{
    if (n == 0) {
        return 1;
    } else {
        return n * dg(n-1);
    }
}

This completes the recursion when n=0 and returns 1 as the termination condition.

Also, your xh code is correct, but if you enter a large number in the main function, such as 20, the program may output the wrong result, because int can only represent up to 2^31-1, beyond which overflow occurs. If you need to calculate the factorial of a larger number, consider using a high precision number library.

Agree 0 0Comment

dgangd 注册会员
2023-02-25 10:08

dg function n=0 returns 1, missing this

Agree 0 0Comment

About the Author

: dx22955 注册会员
这家伙很懒，什么都没留下...

0: Answer

0: Article

0: Question

Question Info

Publish Time: 2023-02-25 10:08

Update Time: 2023-02-25 10:08