任务和代码:使用相同的结构体类型,在main函数中已经对结构体数组进行了初始化,请完成相关函数的定义,实现main函数中要求的功能。
/*
文件名:main.c
作者:小风景
完成日期:2016.7.29
问题描述:使用相同的结构体类型,在main函数中已经对结构体数组进行了初始化,请完成相关函数的定义,实现main函数中要求的功能。
程序输出:
*/
#include <stdio.h>
struct Student
{
char num[13];
char name[10];
int c;
int math;
int english;
int grade;
double average;
};
void calculate(struct Student s[],int n); //计算总分和均分,数据在s数组中,共有n个元素
void sort1(struct Student s[],int n); //按总分降序排序
void sort2(struct Student s[],int n); //按学号升序排序
void output(struct Student s[],int n); //输出成绩单
void outputExcellent(struct Student s[],int n); //输出优秀者:总分超285,单科不低于90
int main()
{
struct Student stu[]= {{"201152501104","Tom",65,69 ,68 },
{"201152501114","Jeery",94 ,89 ,63 },
{"201152501138","Speike",67 ,62 ,84 },
{"201152501204","Tyke",100 ,95 ,91 },
{"201152501202","Tuffy",59 ,80 ,55 },
{"201152501115","Butch",100 ,99 ,89 },
{"201152501201","Lightning",95 ,92 ,99 },
{"201152501145","Topsy",88 ,56 ,67 },
{"201152501203","Droopy",62 ,62 ,95 },
{"201152501140","Drupa",80 ,60 ,86 },
{"201152501205","Buzz",73 ,90 ,94}
};
int stuNum=sizeof(stu)/sizeof(stu[0]); //用sizeof运算确定数组中元素个数
//计算总分和均分后输出
calculate(stu,stuNum);
printf("下面是成绩单:\n");
output(stu,stuNum);
printf("优秀者名单:\n");
outputExcellent(stu,stuNum);
//按总分降序排序后输出
sort1(stu,stuNum);
printf("按总分降序排序后:\n");
output(stu,stuNum);
//按学号升序排序后输出
sort2(stu,stuNum);
printf("按学号升序排序后:\n");
output(stu,stuNum);
return 0;
}
//计算总分和均分,数据在s数组中,共有n个元素
void calculate(struct Student s[],int n)
{
int i = 0;
for(i = 0;i < n; i++)
{
s[i].grade = s[i].c + s[i].math + s[i].english;
s[i].average = s[i].grade / 3.0;
}
}
void output(struct Student s[],int n)
{
int i = 0;
printf("学号\t姓名\tC\t高数\t英语\t总分\t均分\n");
for(i = 0;i < n;i++)
{
printf("%s\t%s\t%d\t%d\t%d\t%d\t%.2f\n",s[i].num,s[i].name,s[i].c,s[i].math,s[i].english,s[i].grade,s[i].average);
}
}
//输出优秀者:总分超285,单科不低于90
void outputExcellent(struct Student s[],int n)
{
int i = 0;
for(i = 0;i < n;i++)
{
if(s[i].c < 90)
{
continue;
}
else if(s[i].math < 90)
{
continue;
}
else if(s[i].english < 90)
{
continue;
}
else if(s[i].grade < 285)
{
continue;
}
else
{
printf("%s\t%s\t%d\t%d\t%d\t%d\t%.2f\n",s[i].num,s[i].name,s[i].c,s[i].math,s[i].english,s[i].grade,s[i].average);
}
}
}
//按总分降序排序
void sort1(struct Student s[],int n)
{
int i = 0;
int j = 0;
int temp = 0;
for(i = 0;i < n - 1;i++)
{
for(j = 0;j < n - i - 1;j++)
{
if(s[j].grade < s[j + 1].grade)
{
temp = s[j + 1].grade;
s[j + 1].grade = s[j].grade;
s[j].grade = temp;
}
}
}
}
//按学号升序排序
void sort2(struct Student s[],int n)
{
int i = 0;
int j = 0;
int k = 0;
int temp = 0;
for(i = 0;i < n - 1;i++)
{
k = i;
for(j = i + 1;j < n;j++)
{
if(s[j].grade < s[k].grade)
{
k = j;
}
}
temp = s[k].grade;
s[k].grade = s[i].grade;
s[i].grade = temp;
}
}
程序运行结果: