std::is_sorted
From Cppreference
| Defined in header <algorithm>
|
||
| template< class ForwardIterator >
bool is_sorted( ForwardIterator first, ForwardIterator last ); |
(1) | (C++11 feature) |
| template< class ForwardIterator, class Compare >
bool is_sorted( ForwardIterator first, ForwardIterator last, Compare comp ); |
(2) | (C++11 feature) |
Checks if the elements in range [first, last) are sorted in ascending order. The first version of the function uses operator< to compare the elements, the second uses the given comparison function comp.
Contents |
[edit] Parameters
| first, last | - | the range of elements to examine | |||||||||
| comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. |
|||||||||
[edit] Return value
true if the elements in the range are sorted in ascending order
[edit] Complexity
linear in the distance between first and last
[edit] Equivalent function
| First version |
|---|
template<class ForwardIterator> bool is_sorted(ForwardIterator first, ForwardIterator last) { return std::is_sorted_until(first, last) == last; } |
| Second version |
template<class ForwardIterator, class Compare> bool is_sorted(ForwardIterator first, ForwardIterator last, Compare comp) { return std::is_sorted_until(first, last, comp) == last; } |
[edit] Example
| This section is incomplete |
[edit] See also
|
finds the largest sorted subrange (function template) |
||