for(i=0;i<n-1;i++) for(j=0;j<n-1-i;j++) if ((stup+j)-ave>(stup+ j+1)->ave) *(stup+j)=s (stup+j+1) k (stup+j+1)=t void pnt (student *stup int n int i, k double sum: printf("Output is \n") for (i=0; i<n: i++) printf(%12s,(stup+i)->name for(k=0;k<4;k++) printf(%5. llf ,(stup+i)->score[k]) printf(%5. llf ",(stup+i)->ave) f((stupti)->flag) printf( * ") printf( " \n") I student stu[N] printf(Enter number: " scanf(%d", &n) input(stu, n) flag(stu, n) sort(stu, n) pnt(stu, n) 810定义一个表示三维空间点坐标的结构类型,设计求空间任两点距离的函数 解:参考程序如下 #include <stdio. hfor (i=0;i<n-1;i++) for (j=0;j<n-1-i;j++) if ((stup+j)->ave > (stup+j+1)->ave) { t=*(stup+j); *(stup+j)=*(stup+j+1); *(stup+j+1)=t; } } void pnt(student *stup,int n) { int i,k; double sum; printf("Output is \n"); for (i=0;i<n;i++) { printf("%12s",(stup+i)->name); for (k=0;k<4;k++) printf("%5.1lf ",(stup+i)->score[k]); printf("%5.1lf ",(stup+i)->ave); if ((stup+i)->flag) printf(" * "); printf("\n"); } } main() { student stu[N]; int n; printf("Enter number:"); scanf("%d",&n); input(stu,n); ave_flag(stu,n); sort(stu,n); pnt(stu,n); } 8.10 定义一个表示三维空间点坐标的结构类型，设计求空间任两点距离的函数。 解：参考程序如下： #include <stdio.h>