sort升序降序排列

#include <bits/stdc++.h>
using namespace std;
void basicSort(){
    vector<int> nums{3,5,2,1,6,9,7};
    sort(nums.begin(),nums.end());
    cout<<"升序";
    for(int n:nums) cout<<n<<" ";
    cout<<endl;
    sort(nums.rbegin(),nums.rend());
    cout<<"降序";
    for(int n:nums) cout<<n<<" ";
}
int main(int argc, char** argv) {
    basicSort();
    return 0;
}