std::min_element

 

C++

Lenguaje

Cabeceras

Conceptos

Biblioteca de utilidades

Biblioteca de cadenas

Biblioteca de contenedores

Biblioteca de algoritmos

Biblioteca de iteradores

Biblioteca numérica

Biblioteca de entrada/salida

Biblioteca de localización

Biblioteca de expresiones regulares(C++11)

Biblioteca de operaciones atómicas(C++11)

Biblioteca de hilos/subprocesos(C++11)

 

Biblioteca de algoritmos

Políticas de ejecución (C++17)
is_execution_policy	execution::seqexecution::parexecution::par_unseq	execution::sequenced_policyexecution::parallel_policyexecution::parallel_unsequenced_policy
Operaciones no modificadoras de secuencia
all_ofany_ofnone_of (C++11)(C++11)(C++11) for_each for_each_n (C++17)	countcount_if mismatch equal adjacent_find	findfind_iffind_if_not (C++11) find_end find_first_of	search search_n lexicographical_compare lexicographical_compare_3way (C++20)
Operaciones modificadoras de secuencia
copycopy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) transform	fill fill_n generate generate_n swap iter_swap swap_ranges sample (C++17)	removeremove_if replacereplace_if reverse rotate unique random_shuffle (hasta C++17)	remove_copyremove_copy_if replace_copyreplace_copy_if reverse_copy rotate_copy unique_copy shuffle (C++11)
Operaciones en almacenamiento no inicializado
uninitialized_copy uninitialized_move (C++17)	uninitialized_copy_n (C++11) uninitialized_move_n (C++17)	uninitialized_fill	uninitialized_fill_n
Operaciones de partición
is_partitioned (C++11) partition_point (C++11)	partition partition_copy (C++11)	stable_partition
Operaciones de ordenación
is_sorted (C++11) is_sorted_until (C++11)	sort stable_sort	partial_sort partial_sort_copy	nth_element
Operaciones de búsqueda binaria
lower_bound	upper_bound	binary_search	equal_range
Operaciones de set (en rangos ordenados)
merge inplace_merge	set_difference set_intersection	set_symmetric_difference set_union	includes
Operaciones de pila
is_heap (C++11) is_heap_until (C++11)	make_heap sort_heap	push_heap pop_heap
Operaciones minimo/maximo
max max_element	min min_element	minmax (C++11) minmax_element (C++11)	clamp (C++17) compare_3way (C++20)
Permutaciones
is_permutation (C++11)	next_permutation	prev_permutation
Operaciones numéricas
iota (C++11) inner_product adjacent_difference	accumulate reduce (C++17) transform_reduce (C++17)	partial_sum inclusive_scan (C++17) exclusive_scan (C++17)	transform_inclusive_scan (C++17) transform_exclusive_scan (C++17)
Bibliotecas C
qsort	bsearch

 

Definido en la cabecera <algorithm>
template<class ForwardIt > ForwardIt min_element( ForwardIt first, ForwardIt last );	(1)
template<class ForwardIt, class Compare > ForwardIt min_element( ForwardIt first, ForwardIt last, Compare comp );	(2)

Busca el elemento más pequeño de la gama [first, last). La primera versión utiliza operator< para comparar los valores, la segunda versión utiliza la función de comparación dado comp .

Original:

Finds the smallest element in the range [first, last). The first version uses operator< to compare the values, the second version uses the given comparison function comp.

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

Parámetros

first, last	-	iteradores hacia adelante que definen el rango de examinar Original: forward iterators defining the range to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
cmp	-	comparison function which returns ​true if if *a is less than *b. 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. ​
Requerimientos de tipo
- ForwardIt debe reunir los requerimientos de ForwardIterator.

Valor de retorno

Iterator al elemento más pequeño de la gama [first, last). Si varios elementos de la gama son equivalentes hasta el más mínimo elemento, devuelve el iterador al elemento primero de ellos. Devoluciones last si el rango está vacío .

Original:

Iterator to the smallest element in the range [first, last). If several elements in the range are equivalent to the smallest element, returns the iterator to the first such element. Returns last if the range is empty.

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

Complejidad

Exactamente max(N-1,0) comparaciones, N =std::distance(first, last) donde .

Original:

Exactly max(N-1,0) comparisons, where N =std::distance(first, last).

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

Posible implementación

Primera versión
template<class ForwardIt> ForwardIt min_element(ForwardIt first, ForwardIt last){if(first == last)return last;   ForwardIt smallest = first;++first;for(; first != last;++first){if(*first <*smallest){ smallest = first;}}return smallest;}
Segunda versión
template<class ForwardIt, class Compare> ForwardIt min_element(ForwardIt first, ForwardIt last, Compare comp){if(first == last)return last;   ForwardIt smallest = first;++first;for(; first != last;++first){if(comp(*first, *smallest)){ smallest = first;}}return smallest;}

Ejemplo

#include <algorithm>#include <iostream>#include <vector>   int main(){std::vector<int> v{3, 1, 4, 1, 5, 9};   std::vector<int>::iterator result = std::min_element(v.begin(), v.end());std::cout<<"min element at: "<<std::distance(v.begin(), result);}

Salida:

min element at: 1

Ver también

max_element	devuelve el elemento más grande de un rango Original: returns the largest element in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (plantilla de función)
minmax_element (C++11)	devuelve el elemento más pequeño y el más grande en un rango Original: returns the smallest and the largest element in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (plantilla de función)
min	devuelve el menor de los dos elementos Original: returns the smaller of two elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (plantilla de función)