sorting

// sort algorithm example
#include
#include
#include
using namespace std;

bool myfunction (int i,int j) { return (i
struct myclass {
bool operator() (int i,int j) { return (i} myobject;

int main () {
int myints[] = {32,71,12,45,26,80,53,33};
vector myvector (myints, myints+8); // 32 71 12 45 26 80 53 33
vector::iterator it;

// using default comparison (operator <):
sort (myvector.begin(), myvector.begin()+4); //(12 32 45 71)26 80 53 33

// using function as comp
sort (myvector.begin()+4, myvector.end(), myfunction); // 12 32 45 71(26 33 53 80)

// using object as comp
sort (myvector.begin(), myvector.end(), myobject); //(12 26 32 33 45 53 71 80)

// print out content:
cout << "myvector contains:";
for (it=myvector.begin(); it!=myvector.end(); ++it)
cout << " " << *it;

cout << endl;

return 0;
}