Description
我们想明白递归函数到底是怎么运作的,所以想用递归来计算当给定一个正整数n(n < 16)时,求出n + (n-1)……+1的值,同时进行一些输出
要求写一个int plus1(int a)形式的函数,在进入递归函数时,输出相关信息。在调用结束返回值前,输出相关信息。最后输出n + (n-1)……+1的值
Input
3
Output
[plus1(3) output]Begin invoke plus1(3)
[plus1(3) output]I want to calculate plus1(3), require 3 and the value of plus1(2),so I need to invoke plus1(2)
[plus1(2) output]Begin invoke plus1(2)
[plus1(2) output]I want to calculate plus1(2), require 2 and the value of plus1(1),so I need to invoke plus1(1)
[plus1(1) output]Begin invoke plus1(1)
[plus1(1) output]return plus1(1) = 1
[plus1(2) output]I got the value of plus1(1), and plus it to 2then return3
[plus1(3) output]I got the value of plus1(2), and plus it to 3then return6
6
ps:你会发现,咦?居然还有小提示,,,其实就是递归输出问题。。。。
这里我只给出plus1的函数,,,,,,,,啦啦啦啦
int plus1(int a)
{
int sum=0;
printf("[plus1(%d) output]Begin invoke plus1(%d)\n", a, a);
if(a == 1)
{
printf("[plus1(1) output]return plus1(1) = 1\n");
return 1;
}
else
{
printf("[plus1(%d) output]I want to calculate plus1(%d), require %d and the value of plus1(%d),so I need to invoke plus1(%d)\n", a, a, a, a-1, a-1);
int c = plus1(a-1);
sum = a+c;
printf("[plus1(%d) output]I got the value of plus1(%d), and plus it to %dthen return%d\n", a, a-1, a, sum);
return sum;
}
}
调试是为了证明bug的存在而不是不存在…