#include <stdio.h>
int sum_recursive(int arr[], int n) {
if (n <= 0)
return 0;
else
return sum_recursive(arr, n-1) + arr[n-1];
}
int sum_iterative(int arr[], int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += arr[i];
}
return sum;
}
int main() {
int arr[] = {1, 2, 3, 4, 5};
int n = sizeof(arr) / sizeof(arr[0]);
int sum_recursive_result = sum_recursive(arr, n);
printf("使用递归方法,数组的和为%d\n", sum_recursive_result);
int sum_iterative_result = sum_iterative(arr, n);
printf("使用递推方法,数组的和为%d\n", sum_iterative_result);
return 0;
}