make_heap

lexicographical_compare

template <class InIter1, class InIter2>    bool lexicographical_compare(InIter1 start1, InIter1 end1,                                  InIter2 start2, InIter2 end2); template <class InIter1, class InIter2, class Comp>     bool lexicographical_compare(InIter1 start1, InIter1 end1,                                  InIter2 start2, InIter2 end2,                                  Comp cmpfn);

The lexicographical_compare( ) algorithm alphabetically compares the sequence defined by start1 and end1 with the sequence defined by start2 and end2. It returns true if the first sequence is lexicographically less than the second (that is, if the first sequence would come before the second using dictionary order).

The second form allows you to specify a comparison function that determines when one element is less than another.