请用c语言请用递归算法,求 1+2+3+4+…+n ,
时间: 2023-09-29 07:06:17 浏览: 111
可以使用以下代码实现:
```c
#include <stdio.h>
int sum(int n) {
if (n == 1) {
return 1;
} else {
return n + sum(n - 1);
}
}
int main() {
int n;
printf("请输入n的值:");
scanf("%d", &n);
printf("1到n的和为:%d\n", sum(n));
return 0;
}
```
运行程序后,输入n的值,即可输出1到n的和。递归的实现思路是不断利用函数自身来实现任务的分解和调用,直到达到最小的任务规模,然后不断回溯汇总调用结果并返回。在本例中,递归函数sum用于计算1到n的和,当参数n为1时,直接返回1;当n大于1时,将n与1到n-1的和相加并返回结果。
相关问题
请用递归算法,求1+2+3+…+n,n由键盘输入。c语言
可以使用递归算法求解1到n的和。具体实现如下:
```c
#include <stdio.h>
int sum(int n) {
if (n == 1) {
return 1;
}
return n + sum(n - 1);
}
int main() {
int n;
printf("请输入一个正整数n:");
scanf("%d", &n);
printf("1+2+...+%d=%d\n", n, sum(n));
return 0;
}
```
在该程序中,`sum`函数是一个递归函数,用于计算1到n的和。首先判断如果n等于1,则直接返回1,否则返回n加上1到n-1的和。在主函数中,读入一个正整数n,调用`sum`函数计算1到n的和并输出结果。
C语言递归算法求sum=1+1/1+2+1/1+2+3+...+1/1+2+3+...+n
#include <stdio.h>
float sum(int n) {
if (n == 1) {
return 1;
} else {
float s = 0;
for (int i = 1; i <= n; i++) {
s += i;
}
return 1.0/s + sum(n-1);
}
}
int main() {
int n;
printf("请输入n:");
scanf("%d", &n);
printf("sum = %.2f", sum(n));
return 0;
}
阅读全文
相关推荐













