#include <stdio.h>
int arraySumRecursive(int arr[], int n) {
if (n == 1) {
return arr[0];
} else {
return arr[n-1] + arraySumRecursive(arr, n-1);
}
}
int arraySumIterative(int arr[], int n) {
int sum = arr[0];
for (int i = 1; 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 sumRecursive = arraySumRecursive(arr, n);
int sumIterative = arraySumIterative(arr, n);
printf("递归算法累加值:%d\n", sumRecursive);
printf("递推算法累加值:%d\n", sumIterative);
return 0;
}