Sorting a vector in descending order

Question

Should I  utilize 

std::sort(numbers.begin(), numbers.end(), std::greater<int>());

or

std::sort(numbers.rbegin(), numbers.rend());   // note: reverse iterators

to sort a vector descendingly? 

Are there any advantages or disadvantages to each approach?

Answer 1

In fact, the first is a horrible idea. 

Use either the second or the following:

struct greater
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};

std::sort(numbers.begin(), numbers.end(), greater());

That way, when someone decides that numbers should hold long or long long instead of int, your code won't fail quietly.