template<class T>
class Greater
{
public:
bool operator()(const T& t1, const T& t2){return t1 > t2;}
};
int main()
{
int sz[] = {1,3,8,10,66,31};
vector<int> ivec(sz, sz + 6), ivec1(sz, sz + 6);
sort(ivec.begin(), ivec.end());
// template<class _RI, class _Ty> inline
// void _Sort_0(_RI _F, _RI _L, _Ty *)
// {if (_L - _F <= _SORT_MAX)
// _Insertion_sort(_F, _L);
// else
// {_Sort(_F, _L, (_Ty *)0);
// _Insertion_sort(_F, _F + _SORT_MAX);
// for (_F += _SORT_MAX; _F != _L; ++_F)
// _Unguarded_insert(_F, _Ty(*_F)); }}
cout << "UP :" ;
vector<int>::const_iterator cit = ivec.begin();
for (; cit != ivec.end(); ++cit)
{
cout << *cit << "/t";
}
cout << endl;
cout << "DOWN :" ;
sort(ivec1.begin(), ivec1.end(), Greater <int>());
cit = ivec1.begin();
for (; cit != ivec1.end(); ++cit)
{
cout << *cit << "/t";
}
cout << endl;
return 0;
}
class Greater
{
public:
bool operator()(const T& t1, const T& t2){return t1 > t2;}
};
int main()
{
int sz[] = {1,3,8,10,66,31};
vector<int> ivec(sz, sz + 6), ivec1(sz, sz + 6);
sort(ivec.begin(), ivec.end());
// template<class _RI, class _Ty> inline
// void _Sort_0(_RI _F, _RI _L, _Ty *)
// {if (_L - _F <= _SORT_MAX)
// _Insertion_sort(_F, _L);
// else
// {_Sort(_F, _L, (_Ty *)0);
// _Insertion_sort(_F, _F + _SORT_MAX);
// for (_F += _SORT_MAX; _F != _L; ++_F)
// _Unguarded_insert(_F, _Ty(*_F)); }}
cout << "UP :" ;
vector<int>::const_iterator cit = ivec.begin();
for (; cit != ivec.end(); ++cit)
{
cout << *cit << "/t";
}
cout << endl;
cout << "DOWN :" ;
sort(ivec1.begin(), ivec1.end(), Greater <int>());
cit = ivec1.begin();
for (; cit != ivec1.end(); ++cit)
{
cout << *cit << "/t";
}
cout << endl;
return 0;
}