n的阶乘
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int factorial(int n)
{
if (n == 1)//递归边界
{
return 1;
}
return n * factorial(n - 1);//递归
}
int main(void)
{
//n的阶乘
int n = 0;
printf("请输入要求的数:\n");
scanf("%d", &n);
printf("%d\n",factorial(n));
return 0;
}
2. 1...n的和
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int sum(int n)
{
if (n == 1)//递归边界
{
return 1;
}
return n + sum(n - 1);//递归
}
int main(void)
{
//1..n的和
int n = 0;
printf("请输入要求的数:\n");
scanf("%d", &n);
printf("%d\n", sum(n));
return 0;
}
3. 打印斐波那契数列
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int Fibonacci(int n)
{
if (n == 1 || n == 2)//递归边界
{
return 1;
}
return Fibonacci(n - 1) + Fibonacci(n - 2);//递归公式
}
int main(void)
{
//斐波那契数列
int n = 0;
printf("请输入项数:\n");
scanf("%d", &n);
for (int i = 1; i <= n; i++)//循环打印每一项的斐波那契数
{
printf("%d\t", Fibonacci(i));
}
return 0;
}