Vector: Insert Erase Sort


#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

void print( vector<int> );

int main()
{
    vector<int> vectorObject(5);                                                    
    print( vectorObject );   

    vector<int>::iterator p =  vectorObject.begin();                                

    cout << *p << endl;

    vectorObject.insert( vectorObject.begin(), 1 );                                          
    print( vectorObject );      

    cout << *p << endl;

    p = vectorObject.begin();   
    cout << *p << endl;
    vectorObject.erase( vectorObject.begin() );                                              
    print( vectorObject );      

    vectorObject.insert( vectorObject.begin() + 1, 1 );                                      
    print( vectorObject );              

    vectorObject.erase( vectorObject.begin() + 2 );                                          
    print( vectorObject );              

    vectorObject.insert( vectorObject.end(), 3 );                                            
    print( vectorObject );              

    vectorObject.erase( vectorObject.end() - 1 );                                            
    print( vectorObject );              

    vectorObject.insert( vectorObject.begin() + 3, 1 );                                      
    print( vectorObject );              
    vectorObject.erase( find( vectorObject.begin(), vectorObject.end(), 6 ) );                        
    print( vectorObject );              

    vectorObject.insert( vectorObject.begin() + 1, 3 );                                      
    vectorObject.insert( vectorObject.begin() + 5, 3 );
    print( vectorObject );                    
    vectorObject.erase( find( vectorObject.begin(), vectorObject.end(), 3 ) ); 
    vectorObject.erase( find( vectorObject.begin(), vectorObject.end(), 3 ) ); 
    print( vectorObject );                                   

    vectorObject[0] = 231;                                                           
    vectorObject[1] = 21;
    vectorObject[2] = 116;
    vectorObject[3] = 45;
    vectorObject[4] = 116;
    print( vectorObject );                                   

    sort( vectorObject.begin(), vectorObject.end() );                                        
    print( vectorObject );                                   

    return 0;
}

void print( vector<int> v ) {
     vector<int>::iterator p = v.begin();
     while ( p != v.end() )
         cout << *p++ << " ";
     cout << endl;
}

Related examples in the same category

1.	Perform an in-place merge for two vectors
2.	Using Other Search functions
3.	Matching Elements Using the equals and mismatch Operations
4.	Creating and Resizing Vectors
5.	Demonstrate count and count_if.
6.	Demonstrate remove_copy in Vector
7.	Access a vector using an iterator.
8.	Demonstrate insert and erase.
9.	Store a class object in a vector.
10.	Demonstrate allocator's max_size() fucntion in vector
11.	Demonstrate count() in vector
12.	Demonstrate count_if().
13.	Demonstrate reverse in vector
14.	Demonstrate insert_iterator in vector
15.	Demonstrate adjacent_difference() in vector
16.	Demonstrate inner_product() in vector
17.	Demonstrate partial_sum() in Vector
18.	Storing Class Objects with overloaded operators in a Vector
19.	Vector Init Array
20.	Use istream_iterator with the copy algorithm
21.	Demonstrate remove_copy and replace_copy.
22.	Demonstrate accumulate() in vector
23.	end() in vector
24.	Use pop_back() and empty().
25.	Access the elements of a vector through an iterator.
26.	The basic operation of a vector: size, push_back,
27.	Accessing a Vector Through an Iterator
28.	Use istream_iterator to read various data types
29.	Create permutations based on vector
30.	Work with heaps: make_heap from vector
31.	Demonstrating the four ways that vectors can be created.
32.	Vector Capacity vs size
33.	Using clear()

Vector: Insert Erase Sort : Vector « Data Structure « C++

Related examples in the same category