斐波那契数列
//递归需要递归关系和递归出口两个要素!
#include<stdio.h>
int f(int n) {
if (n == 1) {
return 1;
}
else if (n == 2) {
return 1;
}
else {
return(f(n - 1) + f(n - 2));
}
}
int main()
{
int num = f(8);
printf("num = %d\n", num);
return 0;
}
数组前n项的和
//递归需要递归关系和递归出口两个要素!
#include<stdio.h>
int sum(int arr[],int n) {
if (n == 0) {
return arr[0];
}
else{
return sum(arr, n - 1) + arr[n];
}
}
int main()
{
int arr[9] = {9,8,7,6,5,4,3,2,1};
int num = sum(arr,8);
printf("num = %d\n", num);
return 0;
}