sort()排序

sort函数:

头文件#include <algorithm>,

默认从小到大，如果降序可写第三方函数进行排序，EXP:sort(array,array+n,cmp)

1普通排序，升序

 1 #include <iostream>
 2 #include <algorithm>
 3 using namespace std;
 4 int main()
 5 {
 6  int a[10]={7,3,4,6,5,1,2,9,8,0};
 7  sort(a,a+10);
 8  for(int i=0;i<10;i++)
 9  cout<<a[i]<<" ";
10  return 0;
11 }
12 OUTPUT:0 1 2 3 4 5 6 7 8 9

View Code

2普通排序，降序

 1 #include <iostream>
 2 #include <algorithm>
 3 using namespace std;
 4 bool cmp(int a,int b)
 5 {
 6  return a>b;
 7 }
 8 int main()
 9 {
10  int a[10]={7,3,4,6,5,1,2,9,8,0};
11  sort(a,a+10,cmp);
12  for(int i=0;i<10;i++)
13  cout<<a[i]<<" ";
14  return 0;
15 }
16 OUTPUT:9 8 7 6 5 4 3 2 1 0

View Code

3结构体排序a升，b降，c降

 1 #include <iostream>
 2 #include <algorithm>
 3 using namespace std;
 4 struct data
 5 {
 6  int a;
 7  int b;
 8  int c;
 9 };
10 bool cmp(data x,data y)
11 {
12  if(x.a!=y.a) return x.a<x.y;
13  if(x.b!=y.b) return x.b>y.b;
14  if(x.c!=y.c) return x.c>y.c;
15 }
16 int main()
17 {
18  .....
19  sort(array,array+n,cmp);
20  return 0;
21 }