//设计一个英雄的结构体,包括成员姓名、年龄、性别;创建结构体数组,数组中存放五名英雄
//通过冒泡排序的算法,将数组中的英雄按照年龄进行升序排序,最终打印排序后的结果
方法一:全在主函数里
#include<iostream>
#include<string>
using namespace std;
struct hero{
string name;
int age;
string sex;
};
int main(){
hero he[5];
he[0] = {"zhangfei",9,"boy"};
he[1] = {"guanyu",10,"boy"};
he[2] = {"xiaoqiao",18,"boy"};
he[3] = {"wuzetian",19,"girl"};
he[4] = {"xiaoguo",8,"girl"};
for(int i=0;i<5;i++){
for(int j = 0;j<5-i;j++){
string mingzi = he[j].name;
int nianling = he[j].age;
string xingbie = he[j].sex;
if(he[j].age>he[j+1].age){
he[j].name = he[j+1].name;
he[j].age = he[j+1].age;
he[j].sex = he[j+1].sex;
he[j+1].name = mingzi;
he[j+1].age = nianling;
he[j+1].sex = xingbie;
}
}
}
for(int i=0;i<5;i++){
cout<<he[i].name<<" "<<he[i].age<<" "<<he[i].sex<<endl;
}
return 0;
}
方法二:
#include<iostream>
#include<string>
using namespace std;
//1、设计英雄结构体
//英雄结构体
struct hero{
//姓名
string name;
//年龄
int age;
//性别
string sex;
};
//冒泡排序 实现年龄升序排列
void bubblesort(struct hero heroarray[],int len){
for (int i = 0;i<len-1;i++){
for(int j = 0;j<len-i-1;j++){
//如果j下标的元素年龄大于j+1下标的元素的年龄,交换两个元素
if(heroarray[j].age>heroarray[j+1].age){
struct hero temp = heroarray[j];
heroarray[j] = heroarray[j+1];
heroarray[j+1] = temp;
}
}
}
}
//打印排序后数组的信息
void printhero(struct hero heroarray[],int len)
{
for(int i = 0;i<len;i++){
cout<<" 姓名:"<<heroarray[i].name<<" 年龄:"<<heroarray[i].age
<<" 性别:"<<heroarray[i].sex<<endl;
}
}
int main(){
//2、创建数组存放5名影响
struct hero heroarray[5]=
{
{"刘备",23,"男"},
{"关羽",22,"男"},
{"张飞",20,"男"},
{"赵云",21,"男"},
{"貂蝉",19,"女"}
};
int len = sizeof(heroarray)/sizeof(heroarray[0]);
cout<<"排序前结果:"<<endl;
for(int i = 0;i<len;i++){
cout<<" 姓名:"<<heroarray[i].name<<" 年龄:"<<heroarray[i].age
<<" 性别:"<<heroarray[i].sex<<endl;
}
//3、对数组进行排序,按照年龄进行升序排序
bubblesort(heroarray,len);
//4、将排序后结果打印输出
cout<<"排序后结果:"<<endl;
printhero(heroarray,len);
return 0;
}