std::min_element

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class T >
ForwardIterator min_element( ForwardIterator first, ForwardIterator last );

</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >

template< class T, class Compare >

ForwardIterator min_element( ForwardIterator first, ForwardIterator last,

                             Compare comp );

</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

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

Parameters

first, last	-	forward iterators defining the range to examine
cmp	-	comparison function object (i.e. an object that satisfies the requirements of Compare) 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); While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)). 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.

Return value

Iterator to the smallest element in the range [first, last).

Complexity

linear in the distance between first and last.

See also

Template:cpp/algorithm/dcl list max elementTemplate:cpp/algorithm/dcl list minmax elementTemplate:cpp/algorithm/dcl list min