std::is_sorted - cppreference.com
Espaços nominais
Variantes
    Ações

      std::is_sorted

      De cppreference.com

      <metanoindex/>

       
      C++
       
      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.
      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.
      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.
      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.
      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.
      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.
      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.
      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.
      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.
      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.
       
      <tbody> </tbody>
      Definido no cabeçalho <algorithm>
      template< class ForwardIt > bool is_sorted( ForwardIt first, ForwardIt last );
      		 (1) (desde C++11)
      template< class ForwardIt, class Compare > bool is_sorted( ForwardIt first, ForwardIt last, Compare comp );
      		 (2) (desde 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)
{
    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;
}

      Exemplo

      #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';
}

      Saída: 

      3 1 4 1 5 : is_sorted: 0
1 1 3 4 5 : is_sorted: 1

      Veja também