http://aetos.it.teithe.gr/~theochim/Me8odologiesProgrammatismouI/cppReference/index-2.html
#include <algorithm>
#include <ext/algorithm>
#include <iostream>
#include <vector>
using namespace std;
void element(vector<int>& v)
{
v.push_back(5);
}
int getMaxInt(vector<int>& v) {
return *max_element(v.begin( ), v.end( ));
}
int main()
{
vector<int> vecval;
element(vecval);
cout << vecval[0] << endl;
vector<int> v;
for (int i=10; i < 20; ++i) v.push_back(i);
cout << "max integer = " << getMaxInt(v) << endl;
//vector <int> vv;
//copy_n(v,3,vv);
//cout << "vv = " << vv << endl;
int myints[]={10,20,30,40,50,60,70};
vector<int> myvector;
vector<int> myv;
myvector.resize(7); // allocate space for 7 elements
//template <class InputIterator, class OutputIterator>
//OutputIterator copy(InputIterator first, InputIterator last,OutputIterator result);
copy ( myints, myints+7, myvector.begin() );
cout << "myvector[0] = " << myvector[0] << endl;
cout << "myvector[1] = " << myvector[1] << endl;
//////////////////////////////////////////////////////////
vector<int> from_vector;
for( int i = 0; i < 10; i++ ) {
from_vector.push_back( i );
}
unsigned int i;
vector<int> to_vector(10);
vector<int> to_vector1(3);
//iterator copy( iterator start, iterator end, iterator dest );
copy( from_vector.begin(), from_vector.end(), to_vector.begin() );
//iterator copy_n( iterator from, size_t num, iterator to );
copy_n( from_vector.begin(), 3, to_vector1.begin() );
cout << "to_vector contains: ";
for( i = 0; i < to_vector.size(); i++ ) {
cout << to_vector[i] << " ";
}
cout << endl;
cout << "to_vector1 contains: ";
for( i = 0; i < to_vector1.size(); i++ ) {
cout << to_vector[i] << " ";
}
cout << endl;
return 0;
}