1.順序排序
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[] = {5,3,7,3,9,4};
sort(a,a+6);
for(int i = 0;i < 6;i ++){
cout<<a[i]<<" ";
}
return 0;
}
2.逆序排序
#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int a,int b){
return a > b;
}
int main(){
int a[] = {5,3,7,3,9,4};
sort(a,a+6,cmp);
for(int i = 0;i < 6;i ++){
cout<<a[i]<<" ";
}
return 0;
}
3.字符串排序
sort(s2.begin(),s2.end());
4.字符串逆序排序
sort(s2.rbegin(),s2.rend());