Namespaces
Variants
Views
Actions

std::min_element

From cppreference.com
 
 
 
Defined in header <algorithm>
template< class ForwardIterator >
ForwardIterator min_element( ForwardIterator first, ForwardIterator last );
(1)
template< class ForwardIterator, class Compare >

ForwardIterator min_element( ForwardIterator first, ForwardIterator last,

                             Compare comp );
(2)

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.

Contents

[edit] Parameters

first, last - forward iterators defining the range to examine
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 ForwardIterator can be dereferenced and then implicitly converted to both of them. ​

[edit] Return value

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.

[edit] Complexity

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

[edit] Possible implementation

[edit] Example

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

Output:

min element at: 1

[edit] See also

returns the largest element in a range
(function template) [edit]
returns the smallest and the largest element in a range
(function template) [edit]
returns the smaller of two elements
(function template) [edit]