quote:Original post by Magmai Kai Holmlor
Wow, what STL library are you using? (If it''s true, that is an excellent diagnostic)

quote:Are you attempting to sort a map or list? Map''s are stored sorted, and list have a member function to sort them.

quote:Original post by Anonymous Poster
if you''re using a std::list, you simply cannot get a random access iterator.
...
use the list::sort() member function, instead.

#include <list>#include <iostream>#include <algorithm> // needed for the for_each algorithm#include <stdlib.h>using namespace std;// just a simple functor for comparing pointers,// since the operator () is templated you don't have// to care about what kind of pointer is passed to it.struct dereference_less{  template <class T>  bool operator () (const T* lhs, const T* rhs) const  {    return *lhs < *rhs;  }};// just a simple functor for cout'ing pointers,// since the operator () is templated you don't have// to care about what kind of pointer is passed to it.struct dereference_cout{  template <class T>  void operator () (T* tp)  {    cout << *tp;  }};int main(){  list<int*> l;  for(int i=0; i < 10; i++)    l.push_back( new int( 9-i ) );  cout << "List created: ";  for_each(l.begin(), l.end(), dereference_cout());  cout << endl;  l.sort( dereference_less() );  cout << "The list is now sorted: ";  for_each(l.begin(), l.end(), dereference_cout());  cout << endl;    std::cin.get();  return 0;}