数据结构实训心得体会.doc

1234for 2011220137void delete(dnode *head)ppc c20112012201051018 m6n3 1. n 152. n n 3 3. n 1152,453254. 5a4 (1) n(2) (3) (4) windows xp-sp3,visual c+) (5) (6) (7) score.c#include stdio.h #include string.h #define m 6 #define n 3 struct student char name10; int number;int scoren+1; /*scoren,score0-score2*/ stum;void changesort(struct student a,int n,int j) int flag=1,i; struct student temp; while(flag) flag=0;for(i=1;i<n-1;i+=2) /*/ if (ai.scorej>ai+1.scorej) temp=ai; ai=ai+1; ai+1=temp; flag=1; for(i=0;i<n-1;i+=2) /*/if (ai.scorej>ai+1.scorej) temp=ai; ai=ai+1; ai+1=temp; flag=1; void print_score(struct student a,int n,int j) int i,k;printf( %d ,j+1); printf(n);printf( n); k=1;for(i=0;k<n&&i<n;i+) if(i>0&&ai.scorej!=ai-1.scorej) k+;printf( %4d ,k); printf(%4d,ai.number); printf( %s,); printf( %6d,ai.scorej); printf(n); main() int i,j,k;for (i=0;i<m;i+) /*/ printf( %d : ,i+1);printf(n); printf( : ); scanf(%s,);printf( : );scanf(%4d,&stui.number); printf(: );scanf(%4d,&stui.score0);printf(: );scanf(%4d,&stui.score1); printf(: );scanf(%4d,&stui.score2);for(i=0;i<m;i+) /*/ stui.scoren=0; for(j=0;j<n;j+)stui.scoren+=stui.scorej;changesort(stu,m,n); /*/printf( n);printf( k=1;for(i=0;i<m;i+) if(i>0&&stui.scoren!=stui-1.scoren) k+;printf(%4d,k);printf( %4d,stui.number);printf( %s,);for(j=0;j<n+1;j+)printf( %6d,stui.scorej);printf(n);changesort(stu,m,0); /*/ print_score(stu,m,0); /* 3 */ changesort(stu,m,1); /*/ n); 2014 5 25 .31.1 .3 1.2 .3 1.3 .3.32.1 .3 2.2 .3.33.1 .3 3.2 .4 3.3 .4.55.1 .5 5.2 .6 5.