当前位置:天才代写 > tutorial > C语言/C++ 教程 > 布局体数组的界说和引用(二)

布局体数组的界说和引用(二)

2017-11-04 08:00 星期六 所属: C语言/C++ 教程 浏览:505

第四步,按平均后果排序,排序算法回收冒泡法。
void order(arr,n)
struct stu arr[];
int n;
{ struct stu temp;
int i,j,x,y;
f o r ( i = 0 ; i < n – 1 ; i + + )
f o r ( j = 0 ; j < n – 1 – i ; j + + )
if (arr[j].score[3]>arr[j+1].score[3])
{ temp=arr[j]; /结*构体范例变量不答允以整体输入或输出,但答允彼此赋值*/
arr[j]=arr[j+1]; /*举办互换* /
a r r [ j + 1 ] = t e m p ;
}
}
第五步,按表格要求输出。
void output(arr,n) /*以表格形式输出有n个元素的布局体范例数组各成员* /
int n;
struct stu arr[];
{int i,j;
printf("********************TABLE********************\n")打;印 /表*头*/
printf("—————————————————-\n");
/ *输出一条程度线* /
p r i n t f ( " | % 1 0 s | % 8 s | % 7 s | % 7 s | % 7 s | % 7 s | \ n " , " N a m e " , " N u m b e r " , " E n g l i s h " , " M a t h e m a " ,
" p h y s i c s " , " a v e r a g e " ) ;
/ * 输出结果为:| Name| Number|English|Mathema|Physics|Average|*/
p r i n t f ( " – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – \ n " ) ;
for (i=0;i<N;I++)
{
p r i n t f ( " | % 1 0 s | % 8 l d | " , a r r [ i ] . n a m e , a r r [ i ] . n u m b e r ) ; / * 输出姓名、学号* /
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) / *对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 ] ; / * 计较单项总和* /
row[i]=row[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 " ) ;
}
第七步,界说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 ( 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 ] ; / * 计较单项总和* /
row[i]=row[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 " ) ;
}

 

    关键字:

[contact-form-7 id="17097" title="form2"]天才代写-代写联系方式