Can member functions be used as comparator functions for STL algorithms?

[unregistered]

if so, how does one go about doing it?

[helios]

Yes, overload the necessary relational operators. For example, std::map and std::set use operator<().

[unregistered]

so I pass in < to the algorithm?
e.g. sort ( iterator1, iterator2, < )?
I seem to have a compiler error

[Bazzy]

If you don't pass anything it will be taken for default


_{from http://www.cplusplus.com/reference/algorithm/sort/}

template <class RandomAccessIterator>
  void sort ( RandomAccessIterator first, RandomAccessIterator last );

template <class RandomAccessIterator, class Compare>
  void sort ( RandomAccessIterator first, RandomAccessIterator last, Compare comp );

Sort elements in range
Sorts the elements in the range [first,last) into ascending order.

The elements are compared using operator< for the first version, and comp for the second.

Elements that would compare equal to each other are not guaranteed to keep their original relative order.