sort函数主要用于排序,在使用时需要#include <algorithm>
。使用方法如下:
void sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp);
其中第一个参数为排序数组起始地址,第二个参数为结束地址,第三个参数comp表示排序方法,不写默认从小到大。
举例
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
//sort函数第三个参数采用默认从小到大
int a[]={45,12,34,77,90,11,2,4,5,55};
sort(a,a+10);
for(int i=0;i<10;i++)
cout<<a[i]<<" ";
system("pause");
return 0;
}
改变第三个参数
#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(int a, int b){
return a > b;
}
int main()
{
//sort函数第三个参数采用默认从小到大
int a[] = { 45, 12, 34, 77, 90, 11, 2, 4, 5, 55 };
sort(a, a + 10, cmp);
for (int i = 0; i<10; i++)
cout << a[i] << " ";
cout << endl;
system("pause");
return 0;
}
对于结构体或者类的排序
需要对第三参数进行重定义
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct Student
{
char name;
int age;
int score;
};
bool comp(Student a, Student b);
int main()
{
Student a[3] = { { 'a',20, 80 }, { 'a',18, 90 }, { 'c',19, 85 } };
sort(a, a + 3,comp);
for (int i = 0; i<3; i++)
cout <<a[i].name<<" "<<a[i].age<<" "<<a[i].score << " ";
cout << endl;
system("pause");
return 0;
}
bool comp(Student a, Student b)
{
if (a.name<b.name)
return a.name > b.name; //名字从大到小排列
else if (a.name == b.name) //如果名字相同,年龄从小到大排列
return a.age<b.age;
}