Loop through a vector in a reversed order : vector sort « Vector « C++

Home
C++
 1 Bitset 2 Class 3 Console 4 Data Structure 5 Data Type 6 Deque 7 Development 8 File 9 Function 10 Generic 11 Language 12 List 13 Map Multimap 14 Overload 15 Pointer 16 Qt 17 Queue Stack 18 Set Multiset 19 STL Algorithms Binary search 20 STL Algorithms Heap 21 STL Algorithms Helper 22 STL Algorithms Iterator 23 STL Algorithms Merge 24 STL Algorithms Min Max 25 STL Algorithms Modifying sequence operations 26 STL Algorithms Non modifying sequence operations 27 STL Algorithms Sorting 28 STL Basics 29 String 30 Valarray 31 Vector
 C++ » Vector » vector sort Screenshots
Loop through a vector in a reversed order
 ```   #include  #include  #include  #include  #include  #include  using namespace std; typedef pair Pair; inline bool less_than_second( const Pair& b1, const Pair& b2 ){    return b1.second < b2.second; } int main( ) {    const char* names[] = { "A","B", "C", "D","E" };    const int values[] = { 18, 20, 26, 30, 41 };    const int num_pairs = sizeof( names ) / sizeof( names[0] );    vector pair( num_pairs );    transform( values, values+num_pairs, names,pair.begin(), make_pair );    sort( pair.begin(), pair.end() );    vector::const_reverse_iterator pair_rend = pair.rend();        for( vector::const_reverse_iterator i= pair.rbegin(); i != pair_rend; ++i )       cout << i->first << " - " << i->second;    sort( pair.begin(), pair.end(), less_than_second );    vector::const_iterator pair_end = pair.end();    for( vector::const_iterator i = pair.begin();       i != pair_end; ++i )    cout << i->second << " - \$" << i->first << " values\n"; }           ```
Related examples in the same category
 1 Create const_reverse_iterator out of vector of pairs 2 Create const_iterator out of vector of pairs 3 sort a vector with duplicates 4 Sort elements in a vector with sort(scores.begin(), scores.end());