8.7 结构体示例二

8.7 结构体示例二

本示例定义了5个人，再将这五个人按年龄升序排列。
step1：
定义好结构体。

struct hero
{
	string name;
	int age;
	string sex;
};

step2:
创建并初始化结构体。

	hero heroarray[5] =
	{
		{"刘备",23,"男"},
		{"关羽",22,"男"},
		{"张飞",20,"男"},
		{"赵云",21,"男"},
		{"貂蝉",19,"女"},
	};

step3:
利用冒泡排序对年龄升序排列

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

step4:
创建打印函数

void printarray(hero heroarray[], int len)
{
	cout << "姓名\t" << "年龄\t" << "性别" << endl;
	for (int i = 0; i < len; i++)
	{
		cout << heroarray[i].name << '\t' << heroarray[i].age << '\t' << heroarray[i].sex << endl;
	}
}

step5:
调用这些函数

	int len = sizeof(heroarray) / sizeof(heroarray[0]);
	cout << "排序前打印：" << endl;
	printarray(heroarray, len);
	cout << "排序后打印：" << endl;
	bubblesort(heroarray, len);
	printarray(heroarray, len);

运行结果：

完整代码如下：

#include<iostream>
#include<string>
using namespace std;

struct hero
{
	string name;
	int age;
	string sex;
};

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

void printarray(hero heroarray[], int len)
{
	cout << "姓名\t" << "年龄\t" << "性别" << endl;
	for (int i = 0; i < len; i++)
	{
		cout << heroarray[i].name << '\t' << heroarray[i].age << '\t' << heroarray[i].sex << endl;
	}
}

int main()
{
	hero heroarray[5] =
	{
		{"刘备",23,"男"},
		{"关羽",22,"男"},
		{"张飞",20,"男"},
		{"赵云",21,"男"},
		{"貂蝉",19,"女"},
	};
	int len = sizeof(heroarray) / sizeof(heroarray[0]);
	cout << "排序前打印：" << endl;
	printarray(heroarray, len);
	cout << "排序后打印：" << endl;
	bubblesort(heroarray, len);
	printarray(heroarray, len);

	system("pause");
	return 0;
}