Sort a 'std::list' containing classes/structures

Question

Hi all,
I find that std::sort' cannot be used to sort 'std::list' because it requires a random access iterator which is not available for a list. Although that works for dqueue without any problem. Is any body know about any workaround for std::list sorting. I have one using template but i required without using template. ??
Using template
#include <iostream>
#include <algorithm>
#include <list>
using namespace std;
typedef struct xx {
int a;
int b;
bool operator<(const xx& src) const;
bool operator>(const xx& src) const;
} X;
bool xx::operator<(const xx& src) const
if (b <= src.b) return true;
return false;
bool xx::operator>(const xx& src) const
if (b > src.b) return true;
return false;
template<typename T>
class PtrClass
public:
T *m_src;
PtrClass(T &src):m_src(&src)
bool operator<(const PtrClass& src) const
return m_src->operator<(*src.m_src);
bool operator>(const PtrClass& src) const
return m_src->operator>(*src.m_src);
int main()
X o1 = {1, 9};
X o2 = {2, 8};
X o3 = {3, 7};
list<PtrClass<X> > l;
list<PtrClass<X> >::iterator it;
l.push_back(o1);
l.push_back(o2);
l.push_back(o3);
cout << " BEFORE ______"<<endl;
for(it = l.begin(); it != l.end(); it++)
     cout << "Inside"<<endl;
l.sort();
cout << " AFTER ______"<<endl;
for(it = l.begin(); it != l.end(); it++)
     cout << "Inside"<<endl;
return 0;
}

Answer 1

1. You can use std::list::sort method.
2. You can use std::set instead of std::list.