Program :
Code:
#include <iostream>
#include <algorchm>
#include <vector>
using namespace std;
bool mfnctn (int i,int j)
{
return (i<j);
}
struct myclass
{
bool operator() (int i,int j)
{
return (i<j);
}
}
myobject;
int main ()
{
int mint[] = {32,71,12,45,26,80,53,33};
vector<int> mvctr (mint, mint+8);
vector<int>::cerator c;
sort (mvctr.begin(), mvctr.begin()+4);
sort (mvctr.begin()+4, mvctr.end(), mfnctn);
sort (mvctr.begin(), mvctr.end(), myobject);
cout << "mvctr contains:";
for (c=mvctr.begin(); c!=mvctr.end(); ++c)
cout << " " << *c;
cout << endl;
return 0;
}
The output of the above program can be :
Code:
mvctr contains: 12 26 32 33 45 53 71 80
Bookmarks