递归和循环求数组和
#include<stdio.h>
int qiuhe(int a[],int lenth){
int s=0;
for(int i=0;i<lenth;i++){
s=s+a[i];
}
return s;
}
int qiuhe1(int a[],int begin,int lenth){
if(begin==lenth) return 0;
int s=qiuhe1(a,begin+1,lenth);
return s+a[begin];
}
int main(){
int a[]={1,2,3,4,5,6,7,8};
int lenth=0;
lenth=sizeof(a)/sizeof(int);
for(int i=0;i<lenth;i++){
printf("%d\n",a[i]);
}
int s=qiuhe(a,lenth);
printf("此数组求和为%d",s);
printf("\n---------------------------\n");
int s1=qiuhe1(a,1,lenth);
printf("此数组求和为%d",s1);
return 0;
}