本文是對嚴(yán)蔚敏數(shù)據(jù)結(jié)構(gòu)(c語言版)習(xí)題集一書中所有

1、說明: 5.20, 10.40;4. 請讀者在自己已經(jīng)解決了某個(gè)題目或進(jìn)行了充分的思考之后,再參考本解答,以保證復(fù)習(xí)效果;5. 由于作者水平所限,本解答中一定存在不少這樣或者那樣的錯(cuò)誤和不足,希望讀者們在閱讀中多動腦、勤思考,爭取發(fā)現(xiàn)和糾正這些錯(cuò)誤,寫出更好的算法來.請將你發(fā)現(xiàn)的錯(cuò)誤或其它值得改進(jìn)之處向作者報(bào)告: yi-ju 第一章 緒論 1.16 void print_descending(int x,int y,int z)/按從大到小順序輸出三個(gè)數(shù) scanf("%d,%d,%d",&x,&y,&z); if(x<y) x<->

2、;y; /<->為表示交換的雙目運(yùn)算符,以下同 if(y<z) y<->z; if(x<y) x<->y; /冒泡排序 printf("%d %d %d",x,y,z);/print_descending 1.17 Status fib(int k,int m,int &f)/求k階斐波那契序列的第m項(xiàng)的值f  int tempd;  if(k<2|m<0) return ERROR;  if(m<k-1) f=0;  e

3、lse if (m=k-1) f=1;  else      for(i=0;i<=k-2;i+) tempi=0;    tempk-1=1; /初始化    for(i=k;i<=m;i+) /求出序列第k至第m個(gè)元素的值          sum=0;      

4、;for(j=i-k;j<i;j+) sum+=tempj;      tempi=sum;        f=tempm;    return OK;/fib分析:通過保存已經(jīng)計(jì)算出來的結(jié)果,此方法的時(shí)間復(fù)雜度僅為O(m2).如果采用遞歸編程(大多數(shù)人都會首先想到遞歸方法),則時(shí)間復(fù)雜度將高達(dá)O(km). 1.18 typedef struct     

5、60;           char *sport;                 enummale,female gender;                 char sc

6、hoolname; /校名為'A','B','C','D'或'E'                 char *result;                 int score; 

7、0;              resulttype; typedef struct                 int malescore;               &#

8、160; int femalescore;                 int totalscore;                scoretype; void summary(resulttype result )/求各校的男女總分和團(tuán)體總分,假設(shè)結(jié)果已經(jīng)儲存在result 數(shù)組

9、中  scoretype score;  i=0;  while(resulti.sport!=NULL)      switch(resulti.schoolname)          case 'A':        score 0 .totalscore+=resulti.s

10、core;        if(resulti.gender=0) score 0 .malescore+=resulti.score;        else score 0 .femalescore+=resulti.score;        break;      case 'B&#

11、39;:        score.totalscore+=resulti.score;        if(resulti.gender=0) score.malescore+=resulti.score;        else score.femalescore+=resulti.score;     

12、   break;                      i+；    for(i=0;i<5;i+)      printf("School %d:n",i);    print

13、f("Total score of male:%dn",scorei.malescore);    printf("Total score of female:%dn",scorei.femalescore);    printf("Total score of all:%dnn",scorei.totalscore);  /summary 1.19 Status algo119(int aARRSIZE)/求i!*2i序列的值且不超過

14、maxint  last=1;  for(i=1;i<=ARRSIZE;i+)   ai-1=last*2*i;   if(ai-1/last)!=(2*i) reurn OVERFLOW;   last=ai-1;   return OK;  /algo119分析:當(dāng)某一項(xiàng)的結(jié)果超過了maxint時(shí),它除以前面一項(xiàng)的商會發(fā)生異常. 1.20 void polyvalue()  float ad;  float

15、 *p=a;  printf("Input number of terms:");  scanf("%d",&n);  printf("Input the %d coefficients from a0 to a%d:n",n,n);  for(i=0;i<=n;i+) scanf("%f",p+);  printf("Input value of x:");  scanf("%