C++ Algorithm minmax_element()

C++ Algorithm minmax_element() function is used to return a pair with an iterator pointing to the smallest value in the range[ first, last) as first element, and largest as second.

If several values are equivalent to smaller, the first iterator points to the first of such values and several values are equivalent to larger, the second iterator points to the last of such values.

Elements are compared using operator < for the first version or using the given binary comparison function comp for the second version.

Syntax

  default (1)      template <class ForwardIterator>                           pair<ForwardIterator,ForwardIterator>                             minmax_element (ForwardIterator first, ForwardIterator last);    custom (2)      template <class ForwardIterator, class Compare>                           pair<ForwardIterator,ForwardIterator>                    minmax_element (ForwardIterator first, ForwardIterator last, Compare comp);  

Parameter

first: An input iterator that indicates the first position of the range to compare.

last: An input iterator that indicates the past last element in the range to compare.

comp: A user-defined binary predicate function that accepts two arguments and returns true if the two arguments are in order otherwise, false. It follows the strict weak ordering to order the elements.

il: An initializer_list with the values to compare.

Return value

It returns the smaller value as first element and larger value as second element in the range [first, last).

If several values are equivalent to smaller, the first iterator points to the first of such values and several values are equivalent to larger, the second iterator points to the last of such values.

Complexity

Complexity is linear in 1.5 times one less than the number of elements compared.

Data races

The objects in the range [first, last) are accessed.

Exceptions

This function throws an exception if any comparison throws an exception.

Note: The invalid parameters cause an undefined behavior.

Example 1

Let’s see the simple example to demonstrate the use of minmax_element():

  #include <algorithm>  #include <iostream>  #include <vector>  using  namespace std;    int main()  {      vector<int> v = { 3, 9, 1, 4, 2, 5, 9 };         auto result = minmax_element(v.begin(), v.end());      cout << “min element at: ” << (result.first – v.begin()) << ‘n’;      cout << “max element at: ” << (result.second – v.begin()) << ‘n’;        return 0;  }  

Output:

min element at: 2  max element at: 6

Example 2

Let’s see another simple example to demonstrate the use of minmax_element() using default version:

  #include <iostream>     // std::cout  #include <algorithm>    // std::minmax_element  #include <array>        // std::array    using namespace std;    int main () {    array<int,7> foo {3,7,2,9,5,8,6};      auto result = minmax_element (foo.begin(),foo.end());      // print result:    cout << “min is ” << *result.first;    cout << “, at position ” << (result.first-foo.begin()) << ‘n’;    cout << “max is ” << *result.second;    cout << “, at position ” << (result.second-foo.begin()) << ‘n’;      return 0;  }   

Output:

min is 2, at position 2  max is 9, at position 3

Example 3

Let’s see another simple example to demonstrate the use of minmax_element() using comparison function:

  #include<iostream>   #include<algorithm>   #include<vector>   using namespace std;       int main()   {       // initializing vector of integers       vector<int> vi = { 5, 3, 4, 4, 3, 5, 3 };                   // declaring pair pointer to catch the return value       pair<vector<int>::iterator, vector<int>::iterator> mnmx;                   // using minmax_element() to find       // minimum and maximum element       // between 0th and 3rd number       mnmx = minmax_element(vi.begin(), vi.begin() + 4);                   // printing position of minimum and maximum values.       cout << “The minimum value position obtained is : “;       cout << mnmx.first – vi.begin() << endl;                   cout << “The maximum value position obtained is : “;       cout << mnmx.second – vi.begin() << endl;                   cout << endl;                   // using duplicated       // prints 1 and 5 respectively       mnmx = minmax_element(vi.begin(), vi.end());                   // printing position of minimum and maximum values.       cout << “The minimum value position obtained is : “;       cout << mnmx.first – vi.begin() << endl;                   cout << “The maximum value position obtained is : “;       cout << mnmx.second – vi.begin()<< endl;             return 0;  }    

Output:

The minimum value position obtained is : 1  The maximum value position obtained is : 0    The minimum value position obtained is : 1  The maximum value position obtained is : 5

Next TopicC++ Algorithm

adjacent_find()algorithm any_of()beginners copy_if()copy()count_if()count()cpp equal()find_end()find_first_of()find_if_not() for_each()find_if()find()professionals tutorial

C++ algorithm minmax_element() function

C++ Algorithm minmax_element()

Syntax

Parameter

Return value

Complexity

Data races

Exceptions

Note: The invalid parameters cause an undefined behavior.

Example 1

Example 2

Example 3

Underwriting of Shares

C++ Math abs() Functions

You may also like