【C语言】递归-阶乘&斐波那契数列

递归

阶乘

int factori(int n)
{
    if(n<=1) return 1;
    return n * factori(n-1);
}
int main()
{
    printf("%d",factori(3));
}

斐波那契数列

int factori(int n)
{
    if(n==1) return 1;
    if(n==0) return 0;
    return factori(n-2) + factori(n-1);
}
int main()
{
    int i;
    scanf("%d",&i);
    printf("%d",factori(i));
}

猜你喜欢

转载自blog.csdn.net/weixin_46143152/article/details/126687644
今日推荐