C++

Forum

 
Sorting through STL containers

amitk3553 (102)
Which type of STL container is used for automatic sorting?

keskiverto (10402)
What is "automatic sorting"?
amitk3553 (102)
Means which container we use for the purpose of sorting?
MrHutch (1822)
Do you mean which containers sort implicitly? Like a set or multiset? http://www.cplusplus.com/reference/set/set/

Example:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 
#include <iostream>
#include <set>

int main( int argc, const char* argv[] )
{
    std::set<int> my_set;

    for( int i = 10; i > 0; --i )
        my_set.insert( i );

    for( const auto &j : my_set )
        std::cout << j << " ";

    return 0;
}
 
1 2 3 4 5 6 7 8 9 10
Last edited on
nvrmnd (656)
AFAIK, there is non.

But you can use std::sort() from <algorithm> ?? 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
 
#include <iostream>
#include <algorithm>
#include <array>

int main()
{
    std::array<int, 8> arr { 23, 353, 64, 876, 44, 99, 100, 34 };
    std::cout << "Unsorted: ";
    for( auto& i : arr ) { std::cout << i << " "; }

    std::sort( arr.begin(), arr.end() );
    std::cout << "\nSorted: ";
    for( auto& i : arr ) { std::cout << i << " "; }
}
Last edited on
coder777 (8444)
std::map does sort on insertion (kind of automatically):

http://www.cplusplus.com/reference/map/map/

really: read some documentation to find more...
Topic archived. No new replies allowed.