【算法图解】T4.1 用递归做加法

#include <stdio.h>
int add(int array[],int num){
    int ret = 0;
    if (num==0){
        ret = 0;
    } else if(num==1){
        ret = array[0];
        printf("函数仅剩最后一个值%d\n",ret);
    } else{
        num=num-1;
        printf("num=%d  ",num);
        printf("add %d  ",array[num]);
        printf("正在进行add(array,%d)\n",num);
        ret = array[num]+add(array,num);
    }
    return ret;
}

int main(){
    int sum=0;
    int a[]={1,2,3,4,5,6,7,8,9,10};
    printf("返回结果：%d\n",add(a,sizeof(a)/sizeof(a[0])));
    printf("当前sum值：%d",sum);
}