C++基础 结构体数组的冒泡排序

#include <iostream>
using namespace std;
struct Hero
{
	string name;
	int age;
};

void bullSort(Hero hArr[],int len){
	for(int i=0;i<len-1;i++){
		for(int j=0;j<len-1-i;j++){
			if(hArr[j].age>hArr[j+1].age){
				Hero temp=hArr[j];
				hArr[j]=hArr[j+1];
				hArr[j+1]=temp;
			}
		}
	}
}

void printHero(Hero hArr[],int len){
	for(int i=0;i<len;i++){
		cout<<hArr[i].name<<" "<<hArr[i].age<<endl;
	}
}

int main(){
	Hero hArr[3]={{"张飞",38},{"刘备",40},{"关羽",37}};
	int len=sizeof(hArr)/sizeof(hArr[0]);
	cout<<"按年龄排序"<<endl;
	cout<<"排序前："<<endl;
	printHero(hArr,len);
	bullSort(hArr,len);
	
	cout<<"排序后："<<endl;
	printHero(hArr,len);
	return 0;
}