one sample about recursive function

最新推荐文章于 2025-01-16 15:26:08 发布

转载最新推荐文章于 2025-01-16 15:26:08 发布 · 345 阅读

本文通过解析一个递归函数的运行流程，以4瓶啤酒的歌曲为例，展示从4瓶逐渐减少到0瓶的过程，通过递归调用描绘了这个循环的美妙音乐之旅。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://stackoverflow.com/questions/21537504/how-is-this-code-skipping-to-the-last-string-and-reversing-the-stack

---------------------------the code start--------------------------------------------------------

#include <stdio.h>

void singSongFor(int numberOfBottles)
{
    if (numberOfBottles == 0)
    {
      printf("there are simply no more bottles of beer on the wall. \n\n");
    } 
    else 
    {
        printf("%d bottles of beer on the wall. %d bottles of beer. \n", numberOfBottles, numberOfBottles);
        int oneFewer = numberOfBottles - 1;
        printf("Take one down, pass it around %d bottles of beer on the wall. \n\n", oneFewer);

        singSongFor(oneFewer);
        printf("Put a bottle in the recycling, %d empty bottles in the bin. \n", numberOfBottles);
    }
}
int main(int argc, const char * argv[])
{
    singSongFor(4);
    return 0;
}

---------------------------the code end--------------------------------------------------------

-------------------------the analyze start----------------------------------

main()
{
    singSongFor(4)
    {
        // prints "4 take one down"
        singSongFor(3)
        {
            // prints "3 take one down"
            singSongFor(2)
            {
                // prints "2 take one down"
                singSongFor(1)
                {
                    // prints "1 take one down"
                    singSongFor(0)
                    {
                        // prints "0 there are simply..."
                    }
                    // prints "recycling 1"
                }
                // prints "recycling 2"
            }
            // prints "recycling 3"
        }
        // prints "recycling 4"
    }
    // end
}
-------------------------the analyze end----------------------------------