1.16voidprint_descending(intx,inty,intz)//按從大到小順序輸出三個數(shù){scanf("%d,%d,%d",&x,&y,&z);if(x<y)x<->y;//<->為表示交換的雙目運算符,以下同if(y<z)y<->z;if(x<y)x<->y;//冒泡排序printf("%d%d%d",x,y,z);}//print_descending1.17Statusfib(intk,intm,int&f)//求k階斐波那契序列的第m項的值f{inttempd;if(k<2||m<0)returnERROR;if(m<k-1)f=0;elseif(m==k-1)f=1;else{for(i=0;i<=k-2;i++)temp=0;temp[k-1]=1;//初始化for(i=k;i<=m;i++)//求出序列第k至第m個元素的值{sum=0;for(j=i-k;j<i;j++)sum+=temp[j];temp=sum;}f=temp[m];}returnOK;}//fib分析:通過保存已經(jīng)計算出來的結(jié)果,此方法的時間復(fù)雜度僅為O(m^2).如果采用遞歸編程(大多數(shù)人都會首先想到遞歸方法),則時間復(fù)雜度將高達(dá)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(resulttyperesult[])//求各校的男女總分和團體總分,假設(shè)結(jié)果已經(jīng)儲存在result[]數(shù)組中{scoretypescore;i=0;while(result.sport!=NULL){switch(result.schoolname){case'A':score[0].totalscore+=result.score;if(result.gender==0)score[0].malescore+=result.score;elsescore[0].femalescore+=result.score;break;case'B':score.totalscore+=result.score;if(result.gender==0)score.malescore+=result.score;elsescore.femalescore+=result.score;break;……?……?……}i++；}for(i=0;i<5;i++){printf("School%d:\n",i);printf("Totalscoreofmale:%d\n",score.malescore);printf("Totalscoreoffemale:%d\n",score.femalescore);printf("Totalscoreofall:%d\n\n",score.totalscore);}}//summary1.19Statusalgo119(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分析:當(dāng)某一項的結(jié)果超過了maxint時,它除以前面一項的商會發(fā)生異常.1.20voidpolyvalue(){floatad;float*p=a;printf("Inputnumberofterms:");scanf("%d",&n);printf("Inputthe%dcoefficientsfroma0toa%d:\n",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=0;i<=n;i++){sum+=xp*(*p++);xp*=x;}printf("Valueis:%f",sum);}//polyvalue2.10StatusDeleteK(SqList&a,inti,intk)//刪除線性表a中第i個元素起的k個元素{if(i<1||k<0||i+k-1>a.length)returnINFEASIBLE;for(count=1;i+count-1<=a.length-k;count++)//注意循環(huán)結(jié)束的條件a.elem[i+count-1]=a.elem[i+count+k-1];a.length-=k;returnOK;}//DeleteK2.11StatusInsert_SqList(SqList&va,intx)//把x插入遞增有序表va中{if(va.length+1>va.listsize)returnERROR;va.length++;for(i=va.length-1;va.elem>x&&i>=0;i--)va.elem[i+1]=va.elem;va