语言实验教学6数组答案

C用，并理解数组的。对二维数组的处理要比较熟悉。【实验】【实验内容一维110int数组a102Fibonacci205个数据为一行进行voidmain(){int{}}3num4105num{inti,n,num[100];longsum=0;floatave;printf("enterthenumberofdata(<100):\n");{}{}}6、136页例5.87假如数组numn插入到a/*thearrayissortedbysmalltobig*/{inta[20],i,n,k;intpoint;printf("pleaseenterthenumberofdata:(<20)");scanf("%d",&n);/*输入原始数据的个数*/for(i=0;i<n;i++)scanf("%d",&a[i]);/*输入的数据要有序*/printf("pleaseenterthenumbertobeinserted："); if(a[i]>k){point=i;break;}{for(i=n;i>point;i--)a[i]=a[i-1];}printf("Thedatais:\n");printf("%d",a[i]);}8、数组的元素的删除：从数组中删除指定的元（位置、数据值{intprintf("enterthenumber:\n");/if(num[i]==n){point=i;break;} /*n存在于数组中*/{ /*point开始的元素逐个前移，从前向后方式*/｝printf("％disnotexist!”,n);printf("%d}910{inti,num[10],count=0;{printf(“enterNOdi+1*给予输入提示*/}printf("Countis:％d”,count}10、实现对n（选择法{inti,j,n,a[100];inttemp;printf("enterthenumber:\n");｛point=i*ii*/if(point!=i)}printf("%d",a[i]);}}11、查找：实现对n（顺序查找、折半查找）{inta[20],i,n,k;intpoint;printf("pleaseenterthenumberofdata:(<20)scanf("%d",&n);/*输入原始数据的个数*/for(i=0;i<n;i++)scanf("%d",&a[i]);printf("pleaseenterthenumbertobelocated："); if(a[i]==k){point=i;break;}printf("theindexis:%d",point);printf("Thedataisnotinthe}{inta[20],k,i,n,h,t,mid;intpoint;printf("pleaseenterthenumberofdata:(<20)scanf("%d",&n);/*输入原始数据的个数*/for(i=0;i<n;iscanf("%d",&a[i]*输入的数据有序！从小到大printf("pleaseenterthenumbertobelocated："); h=0;t=n-1;{if(a[mid]==k){point=mid;elseif(a[mid]>k)h=mid+1;elset=mid-1;}printf("Theindexofdatais:",point);printf("Thedataisnotinthe}二维voidmain(){intprintf("44列的数组：\n"); }{}printf("\n后来的数组：\n"); }}2voidmain(){inta[4][4],i,j;{elseif(i+j==3)} }}voidmain(){intprintf("44列的数组：\n"); }{printf("第%d行的最大值为 }