Espaços nominais
Variantes
Acções

Predefinição:cpp/algorithm/notes heap

Da cppreference.com
Uma pilha' é uma gama de elementos [f,l) que tem as seguintes propriedades:
Original:
A heap is a range of elements [f,l) that has the following properties:
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
  • *f é o maior elemento no intervalo
    Original:
    *f is the largest element in the range
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • um novo elemento pode ser adicionado usando std::push_heap()
    Original:
    a new element can be added using std::push_heap()
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
  • o primeiro elemento pode ser removido usando std::pop_heap()
    Original:
    the first element can be removed using std::pop_heap()
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
O real disposição dos elementos é definido pela implementação.
Original:
The actual arrangement of the elements is implementation defined.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Obtida de "https://pt.cppreference.com/mwiki/index.php?title=Predefinição:cpp/algorithm/notes_heap&oldid=9762"