<metanoindex/>
<tbody> </tbody>| Elemento definito nell'header <algorithm>
|
||
template< class ForwardIt > bool is_sorted( ForwardIt first, ForwardIt last ); |
(1) | (dal C++11) |
template< class ForwardIt, class Compare > bool is_sorted( ForwardIt first, ForwardIt last, Compare comp ); |
(2) | (dal C++11) |
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.
Parametri
| first, last | - | la gamma di elementi da esaminare
Original: the range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| 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 |
| Type requirements | ||
-ForwardIt must meet the requirements of ForwardIterator.
| ||
Valore di ritorno
true if the elements in the range are sorted in ascending order
Complessità
lineare la distanza tra
first e lastOriginal:
linear in the distance between
first and lastThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Possibile implementazione
| First version |
|---|
template<class ForwardIt>
bool is_sorted(ForwardIt first, ForwardIt last)
{
return std::is_sorted_until(first, last) == last;
}
|
| Second version |
template<class ForwardIt, class Compare>
bool is_sorted(ForwardIt first, ForwardIt last, Compare comp)
{
return std::is_sorted_until(first, last, comp) == last;
}
|
Esempio
#include <iostream>
#include <algorithm>
int main()
{
const int N = 5;
int digits[N] = {3, 1, 4, 1, 5};
for (auto i : digits) std::cout << i << ' ';
std::cout << ": is_sorted: " << std::is_sorted(digits, digits+N) << '\n';
std::sort(digits, digits+N);
for (auto i : digits) std::cout << i << ' ';
std::cout << ": is_sorted: " << std::is_sorted(digits, digits+N) << '\n';
}
Output:
3 1 4 1 5 : is_sorted: 0
1 1 3 4 5 : is_sorted: 1
Vedi anche
(C++11) |
trova il più grande subrange ordinato Original: finds the largest sorted subrange The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (funzione di modello) |