课程首页在:http://blog.csdn.net/sxhelijian/article/details/11890759
【项目2-有序的结构体数组】使用同项目1相同的结构体类型,在main函数中已经对结构体数组进行了初始化,请完成相关函数的定义,实现main函数中要求的功能。
struct Student //同项目1 { …… }; void calculate(Student s[],int n); //计算总分和均分,数据在s数组中,共有n个元素 void sort1(Student [],int); //按总分降序排序 void sort2(Student [],int); //按学号升序排序 void output(Student [],int); //输出成绩单 void outputExcellent(Student [],int); //输出优秀者:总分超285,单科不低于90 int main() { 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); cout<<"下面是成绩单:"<<endl; output(stu,stuNum); cout<<"优秀者名单:"<<endl; outputExcellent(stu,stuNum); //按总分降序排序后输出 sort1(stu,stuNum); cout<<"按总分降序排序后:"<<endl; output(stu,stuNum); //按学号升序排序后输出 sort2(stu,stuNum); cout<<"按学号升序排序后:"<<endl; output(stu,stuNum); return 0; }提示:(1)排序中涉及对数组元素的交换,数组元素可以作为整体赋值,如定义了Student t,赋值t=stu[i]、stu[j]=stu[i]都是合法的;(2)当涉及到字符数组表示的字符串的操作时,相关的函数需要#include<cstring>。
参考解答:
#include <iostream> #include <cstring> using namespace std; struct Student { char num[13]; char name[10]; int cpp; int math; int english; int grade; double average; }; void calculate(Student s[],int n); //计算总分和均分,数据在s数组中,共有n个元素 void sort1(Student [],int); //按总分降序排序 void sort2(Student [],int); //按学号升序排序 void output(Student [],int); //输出成绩单 void outputExcellent(Student [],int); //输出优秀者:总分超285,单科不低于90 int main() { 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); cout<<"下面是成绩单:"<<endl; output(stu,stuNum); cout<<"优秀者名单:"<<endl; outputExcellent(stu,stuNum); //按总分降序排序后输出 sort1(stu,stuNum); cout<<"按总分降序排序后:"<<endl; output(stu,stuNum); //按学号升序排序后输出 sort2(stu,stuNum); cout<<"按学号升序排序后:"<<endl; output(stu,stuNum); return 0; } void calculate(Student s[],int n) //计算总分和均分 { int i; for(i=0; i<n; i++) { s[i].grade=s[i].cpp+s[i].math+s[i].english; s[i].average=s[i].grade/3.0; } return; } void sort1(Student s[],int n) //按总分降序排序 { int i,j; Student t; for(j=0; j<n-2; j++) { for(i=0; i<n-j-1; i++) if (s[i].grade<s[i+1].grade) { t=s[i]; //交换结构体 s[i]=s[i+1]; s[i+1]=t; } } return; } void sort2(Student s[],int n) //按学号升序排序 { int i,j; Student t; for(j=0; j<n-2; j++) { for(i=0; i<n-j-1; i++) if (strcmp(s[i].num,s[i+1].num)>0) { t=s[i]; s[i]=s[i+1]; s[i+1]=t; } } return; } void output(Student s[],int n) //输出成绩单 { int i; for(i=0; i<n; i++) { cout<<s[i].num<<", "<<s[i].name<<", "; cout<<s[i].cpp<<", "<<s[i].math<<", "<<s[i].english<<", "; cout<<s[i].grade<<", "<<s[i].average<<endl; } cout<<endl; return; } void outputExcellent(Student s[],int n) //输出优秀者 { int i; for(i=0; i<n; i++) if(s[i].grade>=285&&s[i].cpp>=90&&s[i].math>=90&&s[i].english>=90) { cout<<s[i].num<<", "<<s[i].name<<", "; cout<<s[i].cpp<<", "<<s[i].math<<", "<<s[i].english<<", "; cout<<s[i].grade<<", "<<s[i].average<<endl; } cout<<endl; return; }
==================== 迂者 贺利坚 CSDN博客专栏=================
|== IT学子成长指导专栏 专栏文章分类目录(不定期更新) ==|
|== C++ 课堂在线专栏 贺利坚课程教学链接(分课程年级) ==|
======== 为IT菜鸟起飞铺跑道,和学生一起享受快乐和激情的大学 =======
==================== 迂者 贺利坚 CSDN博客专栏=================
|== IT学子成长指导专栏 专栏文章分类目录(不定期更新) ==|
|== C++ 课堂在线专栏 贺利坚课程教学链接(分课程年级) ==|
======== 为IT菜鸟起飞铺跑道,和学生一起享受快乐和激情的大学 =======