Is there any efficiency advantage in using minmax_element over min_element and max_element together?
<p><code>std::minmax_element</code> : returns a pair consisting of an iterator to the smallest element as the first element and an iterator to the greatest element as the second.</p>

<p><code>std::min_element</code> : returns an iterator to the smallest element in the range [first, last). </p>

<p><code>std::max_element</code> : returns an iterator to the largest element in the range [first, last). </p>

<hr>

<p>Does <code>std::minmax_element</code> uses <strong>sorting</strong> of complete list to achieve this? </p>

<p>Is the overhead of processing <em>returned pair</em> from <code>std::minmax_element</code> worthy enough?</p>