第七步，界说m a i n ( )函数，列出完整的措施清单。
#include
#include
struct stu
{
char name[20];
long number;
float score[4];
} ;
m a i n ( )
{
void input(); / *函数声明* /
void aver();
void order();
void output();
void out_row();
struct stu stud[4]; / * 界说布局体数组* /
float row[3];
i n p u t ( s t u d , 4 ) ; / *依此挪用自界说函数* /
a v e r ( s t u d , 4 ) ;
o r d e r ( s t u d , 4 ) ;
o u t p u t ( s t u d , 4 ) ;
o u t _ r o w ( s t u d , 4 ) ;
}
/ * * * * * * * * * * * * * * * * * * * * * * * * * * * * /
void input(arr,n)
struct stu arr[];
int n;
{ int i,j;
char temp[30];
for (i=0;i<N;I++)
{
printf("\nInput Name,Number,English,Mathema,Physic\n");
g e t s ( a r r [ i ] . n a m e ) ;
g e t s ( t e m p ) ;
a r r [ i ] . n u m b e r = a t o l ( t e m p ) ;
f o r ( j = 0 ; j < 4 ; j + + )
p r i n t f ( " % 7 . 2 f | " , a r r [ i ] . s c o r e [ j ] ) ;
p r i n t f ( " \ n " ) ;
p r i n t f ( " – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – \ n " ) ;
}
}
/ * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * /
void out_row(arr,n)
int n;
struct stu arr[];
{
float row[4]={0,0,0,0};
int i,j;
f o r ( i = 0 ; i < 4 ; i + + )
{
f o r ( j = 0 ; j < n ; j + + )
r o w [ i ] = r o w [ i ] + a r r [ j ] . s c o r e [ i ] ;
r o w [ i ] = r o w [ i ] / n ;
}
printf("|%19c|",’ ‘);
for (i=0;i<4;i++)
p r i n t f ( " % 7 . 2 f | " , r o w [ i ] ) ;
p r i n t f ( " \ n – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – \ n " ) ;
}
措施中要审慎处理惩罚以数组名作函数的参数。由于数组名作为数组的首地点，在形参和实参结适时，通报给子措施的就是数组的首地点。形参数组的巨细最好不界说，以暗示与挪用函数的数组保持一致。在界说的布局体内，成员score[3]用于暗示计较的平均后果，也是我们
用于排序的依据。我们无法用数组元素举办彼此较量，而只能用数组元素的成员score[3]举办较量。在需要互换的时候，用数组元素的整体包罗姓名、学号、三科后果及平均后果举办互换。在措施order（）函数中，较量回收：arr[j].score[3]>arr[j+1].score[3]，而互换则回收：
arr[j]arr[j+1]
