算法库-排序操作

头文件: < algorithm >

is_sorted — 检查范围是否已按升序排列

template< class ExecutionPolicy, class ForwardIt, class Compare >
bool is_sorted( ExecutionPolicy&& policy, ForwardIt first, ForwardIt last,
Compare comp );(C++17 起)
代码实现

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<string>
using namespace std;
int main() {
   
    vector<int> nums{
   1, 4, 2, 6, 2, 45, 2, 6, 95};
    cout << is_sorted(nums.begin(), nums.end()) << endl;
    vector<int> nums1{
   9, 8, 4, 3, 2, 1, 0};
    cout << is_sorted(nums1.begin(), nums1.end()) << endl;
    vector<int> nums2{
   1, 2, 4, 9, 10, 45, 56, 89, 410};
    cout << is_sorted(nums2.begin(), nums2.end()) << endl;
    return 0;
}

运行效果

0
0
1

partial_sort — 排序一个范围的前 N 个元素

函数
template< class ExecutionPolicy, class RandomIt, class Compare >
void partial_sort( ExecutionPolicy&& policy, RandomIt first, RandomIt middle, RandomIt last,Compare comp );(C++17 起)
代码实现

#include<iostream>
#include <algorithm>
#include<vector>
#include<cstdio>