C++ 阶乘程序中的递归 [英] Recursion in c++ Factorial Program

问题描述

你好，我有一段基于其他递归和阶乘程序编写的代码但我的问题是我真的很困惑它是如何存储值并保留它然后在最后返回它

hello i have this piece of code that i coded based on some other recursion and factorial programs but my problem is that i am really confused as to how it stored the value and kept it and then returned it at the end

int factorialfinder(int x)
{
    if (x == 1)
    {
        return 1;
    }else
    {
        return x*factorialfinder(x-1);
    }
}
int main()
{
  cout << factorialfinder(5) << endl;
}

所以 5 进入，通过一次又一次地调用它的函数被乘以 4，然后它得到 1 并返回阶乘答案

so 5 goes in, and gets multiplied by 4 by calling its function again and again and again, then it gets to one and it returns the factorial answer

为什么?我不知道它是如何存储的，为什么 return 1 返回实际答案，它到底在做什么?

why? i have no idea how it got stored, why is return 1 returning the actual answer, what is it really doing?

推荐答案

来源:图片取自:IBM 开发人员网站

看看上面的图片，你会更好地理解它.该数字永远不会被存储，而是被递归调用以计算输出.

Just take a look at the picture above, you will understand it better. The number never gets stored, but gets called recursively to calculate the output.

因此，当您调用 fact(4) 时，当前堆栈用于存储每个参数，因为递归调用发生到 factorialfinder(1).所以计算是这样的:5*4*3*2*1.

So when you call the fact(4) the current stack is used to store every parameter as the recursive calls occur down to factorialfinder(1). So the calculation goes like this: 5*4*3*2*1.

int factorialfinder(int x)         
{
    if (x == 1)        // HERE 5 is not equal to 1 so goes to else
    {
        return 1;
    }else
    {
        return x*factorialfinder(x-1); // returns 5*4*3*2*1  when x==1 it returns 1
    }
}

希望这会有所帮助.

这篇关于C++ 阶乘程序中的递归的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！