Vectors are Containers for Objects
sample programs of these are on the web

Vector Functions

• See Carlos Moreno's An Introduction to the Standard Template Library (STL)

Don't forget to include:

#include // include the "algorithm" library
#include // include the "vector" library
using namespace std; // use standard names

Examples of reordering algorithms operating on complete vectors:

reverse(v.begin(), v.end());
random_shuffle(v.begin(), v.end());
rotate(v.begin(), v.begin()+4, v.end());
next_permutation(next_m1.begin(), next_m1.end(),less());
sort(v1.begin(), v1.end());

Examples of equivalent reordering algorithms operating on portions of vectors:

int begin = 3;
int end = 7;
int array[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
vector vArray(array, array + 10);

random_shuffle(&vArray.at(begin), &vArray.at(end));
random_shuffle(&vArray[begin], &vArray[end]);
random_shuffle(vArray.begin()+begin, vArray.begin()+end);

reverse(&vArray.at(begin), &vArray.at(end));
reverse(&vArray[begin], &vArray[end]);
reverse(vArray.begin()+begin, vArray.begin()+end);

rotate(&vArray.at(begin), &vArray.at(end), vArray.end());
rotate(&vArray[begin], &vArray[end], vArray.end());
rotate(vArray.begin()+begin, vArray.begin()+end, vArray.end());

sort(&vArray.at(begin), &vArray.at(end));
sort(&vArray[begin], &vArray[end]);
sort(vArray.begin()+begin, vArray.begin()+end);

Also see Borland "Help" under:

• Vector
• Genetic Algorithms
• Ordered Collection Algorithms

Putting a 1-D array into a Vector:

// Array declaration and definition
int array[10] = {0,1,2,3,4,5,6,7,8,9};

// Vector declaration and definition
vector v(array, array+10);

// These are all valid function calls
reverse(v.begin(), v.end());
random_shuffle(v.begin(), v.end());
rotate(v.begin(), v.begin() + 1, v.end());
next_permutation(v.begin(), v.end());
sort(v.begin(), v.end());

// This copies the "vector" back to the "array"
for (int i = 0; i < 10; i++) {
array[i] = v[i];
}

Putting a 2-D array into a Vector:

// Coordinate array declaration and definition
int array[10][2] = {0, 10, 1, 11, 2, 12, 3, 13, 4, 14,
5, 15, 6, 16, 7, 17, 8, 18, 9, 19};

// Temporary coordinate array declaration and definition
int tempArray[10][2];

// Index array declaration and definition

int index[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};

// Vector declaration and definition
vector v(index, index+10);

// These are all valid function calls

reverse(v.begin(), v.end());
random_shuffle(v.begin(), v.end());
rotate(v.begin(), v.begin() + 1, v.end());
next_permutation(v.begin(), v.end());
sort(v.begin(), v.end());

// This copies the "vector" back to the "array"

// use the VECTOR indices and the original array to create a tempArray
for (int i = 0; i < 10; i++) {
tempArray[i][0] = array[v[i]][0];
tempArray[i][1] = array[v[i]][1];
}
// copy the tempArray back to the original array
for (int i = 0; i < 10; i++) {
array[i][0] = tempArray[i][0];
array[i][1] = tempArray[i][1];
}

Putting a TPoint structure array into a Vector:

// TPoint declaration and definition
TPoint city[10] = {Point(0, 10), Point(1, 11), Point(2, 12), Point(3, 13), Point(4, 14),
Point(5, 15), Point (6, 16), Point(7, 17), Point (8, 18), Point(9, 19)};

//Vector declaration and definition
vector vcity(city, city+10);

// These are all valid function calls
reverse(vcity.begin(), vcity.end());
random_shuffle(vcity.begin(), vcity.end());
rotate(vcity.begin(), vcity.begin() + 1, vcity.end());
// CAUTION: Do not attempt to call either sort() or next_permutation(). These are undefined procedures.

// This copies the "vector" back to the "array"
for (int i = 0; i < 10; i++) {
city[i].x = vcity[i].x; city[i].y = vcity[i].y;
}