     </p>
<p>
          These algorithms use a <span class="bold"><strong>comparison object</strong></span>,
          in the same way as the standard library sort algorithms. If you don't define
          it, the comparison object defaults to std::less, which uses the &lt; operator
          internally for comparisons.
        </p>
<p>
          These algorithms are <span class="bold"><strong>exception safe</strong></span>, meaning
          that, the exceptions generated by the algorithms guarantee the in