I use this method to sort a vector and it works good. The sort is in
ascending order like:
15
16
17
etc...
Is it possible using this method in anyway to reverse the order like:
17
16
15
etc...
Code:std::vector<string> Sorting; std::sort(Sorting.begin(), Sorting.end());
Can you use a reverse iterator, rbegin() and rend(), after you have sorted it?
Todd
Mainframe assembler programmer by trade. C coder when I can.
Yes that did it. Thanks.
It should be possible to sort using reverse iterators in the first place.
I might be wrong.
Quoted more than 1000 times (I hope).Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
Default sorting criteria uses less-than (<) for comparisons which results in sorted order going from least to greatest. To reverse the order, you can force the sort to use greater-than (>) instead which will result in the order going from greatest to least:
Code:#include <functional> ... std::vector<string> Sorting; ... std::sort(Sorting.begin(), Sorting.end(),std::greater<std::string>());
"Owners of dogs will have noticed that, if you provide them with food and water and shelter and affection, they will think you are god. Whereas owners of cats are compelled to realize that, if you provide them with food and water and shelter and affection, they draw the conclusion that they are gods."
-Christopher Hitchens
Yes, but in this case:Default sorting criteria uses less-than (<) for comparisons which results in sorted order going from least to greatest. To reverse the order, you can force the sort to use greater-than (>) instead which will result in the order going from greatest to least:
is good enough.Code:std::sort(Sorting.rbegin(), Sorting.rend());
Look up a C++ Reference and learn How To Ask Questions The Smart WayOriginally Posted by Bjarne Stroustrup (2000-10-14)
>> In this case: std::sort(Sorting.rbegin(), Sorting.rend()); is good enough.
I'd prefer the version with greater. It's easy to overlook the rbegin and rend and assume it's an ascending sort.
