欢迎来到天天文库
浏览记录
ID:52805515
大小:525.50 KB
页数:14页
时间:2020-03-30
《C语言程序设计教程第7章.doc》由会员上传分享,免费在线阅读,更多相关内容在行业资料-天天文库。
1、103数组7.1一维数组7.1.1一维数组的定义图7.1数组的存储空间7.1.2一维数组的初始化7.1.3一维数组元素的引用7.1.4一维数组程序举例#include#defineSTUNUM30voidmain(){intscore[STUNUM],i;floataverage=0.0;printf("Inputscore:");for(i=0;i2、f("Average=%f",average);printf("Thelowerscores:");第7章章数组103for(i=0;ivoidmain(){inti;inta[20]={1,1};for(i=2;i<20;i++)a[i]=a[i-1]+a[i-2];for(i=0;i<20;i++){if(i%5==0)printf("");/*用来控3、制换行,每行输出5个数据。*/printf("%10d",a[i]);}}(a)第1轮比较过程(b)其余各轮排序结果图7.2起泡法排序过程示意图#includevoidmain(){inti,j,t,a[10];printf("Input10digits:");for(i=0;i<10;i++)scanf("%d",&a[i]);for(i=1;i<10;i++)for(j=0;j<10-i;j++)if(a[j]>a[j+1]){t=a[j];a[j]=a[j+1];a[j+1]=t;}第7章章数组103printf("Thesorteddig4、its:");for(i=0;i<10;i++)printf("%d",a[i]);printf("");}图7.3起泡法排序流程图图7.4选择法排序流程图#include#defineN10voidmain(){inta[N],i,j,k,t;printf("Pleaseinput%ddigits:",N);for(i=0;i5、i趟扫描,找最大值,k记住最大元素下标*/if(a[j]6、.4二维数组程序举例#includevoidmain(){inta[2][3]={{2,3,4},{5,6,7}};intb[3][2],i,j;printf("arraya:");for(i=0;i<=1;i++){for(j=0;j<=2;j++){printf("%5d",a[i][j]);b[j][i]=a[i][j];}printf("");}printf("arrayb:");for(i=0;i<=2;i++){for(j=0;j<=1;j++)printf("%5d",b[i][j]);printf("");第7章章数组7、103}}#includevoidmain(){inta[][4]={3,16,87,65,4,32,11,108,10,25,12,27};intb[3],i,j,max;for(i=0;i<3;i++){max=a[i][0];for(j=1;j<4;j++)if(a[i][j]>max)max=a[i][j];b[i]=max;}printf("arraya:");for(i=0;i<=2;i++){for(j=0;j<=3;j++)printf("%5d",a[i][j]);printf("");}printf(
2、f("Average=%f",average);printf("Thelowerscores:");第7章章数组103for(i=0;ivoidmain(){inti;inta[20]={1,1};for(i=2;i<20;i++)a[i]=a[i-1]+a[i-2];for(i=0;i<20;i++){if(i%5==0)printf("");/*用来控
3、制换行,每行输出5个数据。*/printf("%10d",a[i]);}}(a)第1轮比较过程(b)其余各轮排序结果图7.2起泡法排序过程示意图#includevoidmain(){inti,j,t,a[10];printf("Input10digits:");for(i=0;i<10;i++)scanf("%d",&a[i]);for(i=1;i<10;i++)for(j=0;j<10-i;j++)if(a[j]>a[j+1]){t=a[j];a[j]=a[j+1];a[j+1]=t;}第7章章数组103printf("Thesorteddig
4、its:");for(i=0;i<10;i++)printf("%d",a[i]);printf("");}图7.3起泡法排序流程图图7.4选择法排序流程图#include#defineN10voidmain(){inta[N],i,j,k,t;printf("Pleaseinput%ddigits:",N);for(i=0;i5、i趟扫描,找最大值,k记住最大元素下标*/if(a[j]6、.4二维数组程序举例#includevoidmain(){inta[2][3]={{2,3,4},{5,6,7}};intb[3][2],i,j;printf("arraya:");for(i=0;i<=1;i++){for(j=0;j<=2;j++){printf("%5d",a[i][j]);b[j][i]=a[i][j];}printf("");}printf("arrayb:");for(i=0;i<=2;i++){for(j=0;j<=1;j++)printf("%5d",b[i][j]);printf("");第7章章数组7、103}}#includevoidmain(){inta[][4]={3,16,87,65,4,32,11,108,10,25,12,27};intb[3],i,j,max;for(i=0;i<3;i++){max=a[i][0];for(j=1;j<4;j++)if(a[i][j]>max)max=a[i][j];b[i]=max;}printf("arraya:");for(i=0;i<=2;i++){for(j=0;j<=3;j++)printf("%5d",a[i][j]);printf("");}printf(
5、i趟扫描,找最大值,k记住最大元素下标*/if(a[j]6、.4二维数组程序举例#includevoidmain(){inta[2][3]={{2,3,4},{5,6,7}};intb[3][2],i,j;printf("arraya:");for(i=0;i<=1;i++){for(j=0;j<=2;j++){printf("%5d",a[i][j]);b[j][i]=a[i][j];}printf("");}printf("arrayb:");for(i=0;i<=2;i++){for(j=0;j<=1;j++)printf("%5d",b[i][j]);printf("");第7章章数组7、103}}#includevoidmain(){inta[][4]={3,16,87,65,4,32,11,108,10,25,12,27};intb[3],i,j,max;for(i=0;i<3;i++){max=a[i][0];for(j=1;j<4;j++)if(a[i][j]>max)max=a[i][j];b[i]=max;}printf("arraya:");for(i=0;i<=2;i++){for(j=0;j<=3;j++)printf("%5d",a[i][j]);printf("");}printf(
6、.4二维数组程序举例#includevoidmain(){inta[2][3]={{2,3,4},{5,6,7}};intb[3][2],i,j;printf("arraya:");for(i=0;i<=1;i++){for(j=0;j<=2;j++){printf("%5d",a[i][j]);b[j][i]=a[i][j];}printf("");}printf("arrayb:");for(i=0;i<=2;i++){for(j=0;j<=1;j++)printf("%5d",b[i][j]);printf("");第7章章数组
7、103}}#includevoidmain(){inta[][4]={3,16,87,65,4,32,11,108,10,25,12,27};intb[3],i,j,max;for(i=0;i<3;i++){max=a[i][0];for(j=1;j<4;j++)if(a[i][j]>max)max=a[i][j];b[i]=max;}printf("arraya:");for(i=0;i<=2;i++){for(j=0;j<=3;j++)printf("%5d",a[i][j]);printf("");}printf(
此文档下载收益归作者所有