C++ list容器排序案例

排序算法
案例描述:将Person自定义数据类型进行排序，Person中属性有姓名、年龄、身高
排序规则:按照年龄进行升序，如果年龄相同按照身高进行降序

代码如下: 

创建list容器.cpp文件

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<string>
#include<list>
using namespace std;
class Person
{
public:

	Person(string name,int age,int height)
	{
		this->m_Age = age;
		this->m_Height = height;
		this->m_Name = name;
	}

	string m_Name;
	int m_Age;
	int m_Height;
};
//打印
void printList(const list<Person>&l)
{
//遍历
	for (list<Person>::const_iterator it = l.begin(); it != l.end(); it++)
	{
		cout << " 姓名: " << it->m_Name
			 << " 年龄: " << it->m_Age
			 << " 身高: " << it->m_Height << endl;
	}
	cout << endl;
}
//指定排序规则
bool comparePerson(const Person &p1,const Person &p2)
{
	if (p1.m_Age==p2.m_Age)
	{
		//年龄相同 按照身高降序
		return p1.m_Height > p2.m_Height;
	}
	else
	{
		//按照年龄进行升序
		return p1.m_Age < p2.m_Age;
	}
}
void test()
{
	list<Person> L1;

	//准备数据
	Person p1("刘备", 35, 175);
	Person p2("曹操", 45, 185);
	Person p3("孙权", 40, 170);
	Person p4("赵云", 25, 190);
	Person p5("张飞", 35, 160);
	Person p6("关羽", 35, 200);

	//插入数据
	L1.push_back(p1);
	L1.push_back(p2);
	L1.push_back(p3);
	L1.push_back(p4);
	L1.push_back(p5);
	L1.push_back(p6);

	cout << " 排序前: " << endl;
	printList(L1);

	cout << "-------------------" << endl;
	cout << " 排序后: " << endl;

	L1.sort(comparePerson);
	printList(L1);

}
int main()
{


	test();

	system("pause");

	return 0;
}

 运行结果:

    总结:
    1.对于自定义数据类型，必须要指定排序规则，否则编译器不知道如何进行排序
    2.高级排序只是在排序的规则上再进行一次逻辑规则制定，并不复杂