std::is_sorted

 

C++

Linguagem

Conceitos

Biblioteca de utilitários

Biblioteca cordas

Recipientes biblioteca

Biblioteca algoritmos

Biblioteca iteradores

Biblioteca numéricos

De entrada / saída da biblioteca

Biblioteca localizações

Biblioteca de expressões regulares(C++11)

Biblioteca operações atômica(C++11)

Biblioteca de suporte a discussão(C++11)

 

Biblioteca algoritmo

Funções Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Não modificar operações de seqüência Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modificando operações de seqüência Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Particionamento operações Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Operações de classificação (em intervalos ordenados) Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binários operações de busca (em intervalos ordenados) Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
Definir operações (em intervalos ordenados) Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Operações de pilha Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Mínimo / máximo de operações Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Operações numéricas Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C biblioteca Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template<class ForwardIt > bool is_sorted( ForwardIt first, ForwardIt last );	(1)	(a partir do C++ 11)
template<class ForwardIt, class Compare > bool is_sorted( ForwardIt first, ForwardIt last, Compare comp );	(2)	(a partir do 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.

Parâmetros

first, last	-	a gama de elementos para examinar 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:  bool cmp(const Type1 &a, const Type2 &b); The signature does not need to have const&, but the function must not modify the objects passed to it. The types Type1 and Type2 must be such that an object of type ForwardIt can be dereferenced and then implicitly converted to both of them. ​
Type requirements
- ForwardIt must meet the requirements of ForwardIterator.

Valor de retorno

true if the elements in the range are sorted in ascending order

Complexidade

linear, em que a distância entre first e last

Original:

linear in the distance between first and last

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Possível implementação

First version
template<class ForwardIt>bool is_sorted(ForwardIt first, ForwardIt last){returnstd::is_sorted_until(first, last)== last;}
Second version
template<class ForwardIt, class Compare>bool is_sorted(ForwardIt first, ForwardIt last, Compare comp){returnstd::is_sorted_until(first, last, comp)== last;}

Exemplo

#include <iostream>#include <algorithm>   int main(){constint 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

Veja também

is_sorted_until (C++11)	localiza o maior subrange classificados 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. (modelo de função)