//编写程序使学生的档案记录按照学号从小到大进行排序

来源：互联网发布：一建做题软件编辑：程序博客网时间：2024/05/01 21:11
//编写程序使学生的档案记录按照学号从小到大进行排序 #include<iostream.h>#define student__num 5#include<conio.h> struct student{   int num;   char name[20];   char sex;   float score;                     } ;void displaystudentinfo(const student [],int );void sortarray(student [],int);int main(){  student theclass[student__num]={                                      {110,"zhang ping",'M',45},                                  {120,"li xiaoming",'M',92},                                  {153,"wang gang",'N',89},                                  {456,"weishanshan",'N',98},                                  {444,"wiehsfff",'M',99}                                   };  cout<<"Initial student information:\n";  displaystudentinfo(theclass,student__num);    cout<<"\nAfter sorting:\n";  sortarray(theclass,student__num);  displaystudentinfo(theclass,student__num);    getch();   return 0;                                                                      } void displaystudentinfo(const student studs[],int len){   for(int i=0;i<len;i++)    {       cout<<"num="<<studs[i].num<<"\t";       cout<<"name="<<studs[i].name<<"\t";        cout<<"sex="<<studs[i].sex<<"\t";       cout<<"score="<<studs[i].score<<endl;                      }      } void sortarray(student studs [],int len){     int k;   for(int pass=0;pass<len-1;pass++)    {       for(int i=pass+1;i<len;i++)                if(studs[pass].score<studs[i].score)               k=i;                         student hold;          hold=studs[pass];          studs[pass]=studs[k];          studs[k]=hold;               }               }