欢迎来到天天文库
浏览记录
ID:16574126
大小:28.36 KB
页数:30页
时间:2018-08-22
《严蔚敏《数据结构(c语言版)习题集》算法设计题答案[1]》由会员上传分享,免费在线阅读,更多相关内容在行业资料-天天文库。
1、严蔚敏《数据结构(c语言版)习题集》算法设计题答案[1]严蔚敏《数据结构(c语言版)习题集》算法设计题答案第一章绪论1.16voidprint_descending(intx,inty,intz)//按从大到小顺序输出三个数{scanf("%d,%d,%d",&x,&y,&z);if(xy;//<->为表示交换的双目运算符,以下同if(yz;if(xy;//冒泡排序printf("%d%d%d",x,y,z);}//print_descending1.17Statusfib(intk,intm,
2、int&f)//求k阶斐波那契序列的第m项的值f{inttempd;if(k<2
3、
4、m<0)returnERROR;if(m5、时间复杂度仅为O(m^2).如果采用递归编程(大多数人都会首先想到递归方法),则时间复杂度将高达O(k^m).1.18typedefstruct{char*sport;enum{male,female}gender;charschoolname;//校名为'A','B','C','D'或'E'char*result;intscore;}resulttype;typedefstruct{intmalescore;intfemalescore;inttotalscore;}scoretype;voidsummary(resulttypere6、sult[])//求各校的男女总分和团体总分,假设结果已经储存在result[]数组中{scoretypescore;i=0;while(result[i].sport!=NULL){switch(result[i].schoolname){case'A':score[0].totalscore+=result[i].score;if(result[i].gender==0)score[0].malescore+=result[i].score;elsescore[0].femalescore+=result[i].score;brea7、k;case'B':score.totalscore+=result[i].score;if(result[i].gender==0)score.malescore+=result[i].score;elsescore.femalescore+=result[i].score;break;………………}i++;}for(i=0;i<5;i++){printf("School%d:",i);printf("Totalscoreofmale:%d",score[i].malescore);printf("Totalscoreoffe8、male:%d",score[i].femalescore);printf("Totalscoreofall:%d",score[i].totalscore);}}//summaryStatusalgo119(inta[ARRSIZE])//求i!*2^i序列的值且不超过maxint{last=1;for(i=1;i<=ARRSIZE;i++){a[i-1]=last*2*i;if((a[i-1]/last)!=(2*i))reurnOVERFLOW;last=a[i-1];returnOK;}}//algo119分析:当某9、一项的结果超过了maxint时,它除以前面一项的商会发生异常.1.20voidpolyvalue(){floatad;float*p=a;printf("Inputnumberofterms:");scanf("%d",&n);printf("Inputthe%dcoefficientsfroma0toa%d:",n,n);for(i=0;i<=n;i++)scanf("%f",p++);printf("Inputvalueofx:");scanf("%f",&x);p=a;xp=1;sum=0;//xp用于存放x的i次方for(i10、=0;i<=n;i++){sum+=xp*(*p++);xp*=x;}printf("Valueis:%f",sum);}//polyvalue第二章线性表2.10StatusDeleteK(SqList&
5、时间复杂度仅为O(m^2).如果采用递归编程(大多数人都会首先想到递归方法),则时间复杂度将高达O(k^m).1.18typedefstruct{char*sport;enum{male,female}gender;charschoolname;//校名为'A','B','C','D'或'E'char*result;intscore;}resulttype;typedefstruct{intmalescore;intfemalescore;inttotalscore;}scoretype;voidsummary(resulttypere
6、sult[])//求各校的男女总分和团体总分,假设结果已经储存在result[]数组中{scoretypescore;i=0;while(result[i].sport!=NULL){switch(result[i].schoolname){case'A':score[0].totalscore+=result[i].score;if(result[i].gender==0)score[0].malescore+=result[i].score;elsescore[0].femalescore+=result[i].score;brea
7、k;case'B':score.totalscore+=result[i].score;if(result[i].gender==0)score.malescore+=result[i].score;elsescore.femalescore+=result[i].score;break;………………}i++;}for(i=0;i<5;i++){printf("School%d:",i);printf("Totalscoreofmale:%d",score[i].malescore);printf("Totalscoreoffe
8、male:%d",score[i].femalescore);printf("Totalscoreofall:%d",score[i].totalscore);}}//summaryStatusalgo119(inta[ARRSIZE])//求i!*2^i序列的值且不超过maxint{last=1;for(i=1;i<=ARRSIZE;i++){a[i-1]=last*2*i;if((a[i-1]/last)!=(2*i))reurnOVERFLOW;last=a[i-1];returnOK;}}//algo119分析:当某
9、一项的结果超过了maxint时,它除以前面一项的商会发生异常.1.20voidpolyvalue(){floatad;float*p=a;printf("Inputnumberofterms:");scanf("%d",&n);printf("Inputthe%dcoefficientsfroma0toa%d:",n,n);for(i=0;i<=n;i++)scanf("%f",p++);printf("Inputvalueofx:");scanf("%f",&x);p=a;xp=1;sum=0;//xp用于存放x的i次方for(i
10、=0;i<=n;i++){sum+=xp*(*p++);xp*=x;}printf("Valueis:%f",sum);}//polyvalue第二章线性表2.10StatusDeleteK(SqList&
此文档下载收益归作者所有