编辑代码

#include <stdio.h>
//递归方法
int sum1(int *arr, int len) {
    if(len == 0)
    return 0;
    return arr[0] + sum1(arr+1,len-1);
}
//递推方法
int sum2(int arr[], int n) {
    int sum = 0;
    for (int i = 0; i < n; i++) {
        sum += arr[i];
    }
    return sum;
}

int main() {
    int arr[] = {11,22,33,44,55,66};
    int n = sizeof(arr) / sizeof(arr[0]);

    int totalSum = sum1(arr,6);
    printf("数组[11,22,33,44,55,66]递归总和： %d\n", totalSum);

    int totalSum_t = sum2(arr, n);
    printf("数组[11,22,33,44,55,66]递推总和： %d\n", totalSum_t);

    return 0;
}