Sorting a vector in descending order

Should I use

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

or

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

to sort a vector in descending order? Are there any benefits or drawbacks with one approach or the other?

With c++14 you can do this:

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

Stack Overflow Q#9025084, score: 169