Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- const int quant=2;
- const int marks=1;
- void EnterInfo(int k);
- void Displayinfo(int k);
- void Sort();
- struct student
- {
- char name[20];
- char group[5];
- int marks[5];
- float medmark;
- }
- person[quant];
- int main()
- {
- int ch=1;
- char ch2='y';
- while(ch!=0)
- {
- cout<<"Make a choice: "<<endl
- <<"1 - Edit"<<endl
- <<"2 - Show"<<endl
- <<"3 - Sort"<<endl
- <<"0 - Exit"<<endl;
- cout<<"-------------------------"<<endl;
- cin>>ch;
- switch(ch)
- {
- case 1:
- for(int i=0;i<quant;i++)
- {
- cout<<"Info for Student: "<<i+1<<endl;
- //cout<<"This student?(y/n)"<<endl;
- //cin>>ch2;
- ////if(ch2=='y')
- //{
- EnterInfo(i);
- //}
- //else
- // continue;
- }
- break;
- case 2:
- for(int i=0;i<quant;i++)
- {
- if((person[i].name)!="/0")
- Displayinfo(i);
- else
- continue;
- }
- break;
- case 3:
- Sort();
- break;
- default:
- return 0;
- }
- }
- return 0;
- }
- void EnterInfo(int k)
- {
- cout<<"Enter info: "<<endl
- <<"============"<<endl
- <<"Name: "<<endl;
- cin>>person[k].name;
- cout<<"Group: "<<endl;
- cin>>person[k].group;
- cout<<"Marks: "<<endl;
- for(int j=0;j<marks;j++)
- {
- cout<<"Mark: "<<j+1<<" is: ";
- cin>>person[k].marks[j];
- person[k].medmark+=person[k].marks[j];
- }
- }
- void Displayinfo(int k)
- {
- cout<<"Name: "<<person[k].name<<" Group: "<<person[k].group<<" Med mark: "<<person[k].medmark<<endl
- <<"---"<<endl;
- }
- void Sort()
- {
- int sort[quant];
- float tmp;
- char tmpName[20];
- char tmpGroup[20];
- // sorting
- for(int i = 0; i <= quant-1; i++)
- {
- for( int j = 0; j <= quant-2-i; j++)
- {
- if( person[j].medmark < person[j+1].medmark)
- {
- tmp = person[j].medmark;
- strcpy(tmpName,person[j].name);
- strcpy(tmpGroup, person[j].group);
- person[j].medmark = person[j+1].medmark;
- strcpy(person[j].name,person[j+1].name);
- strcpy(person[j].group,person[j+1].group);
- person[j+1].medmark = tmp;
- strcpy(person[j+1].name,tmpName);
- strcpy(person[j+1].group,tmpGroup);
- }
- }
- }
- for(int i=0;i<quant;i++)
- Displayinfo(i);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement