sorting vectors based on size()

Question

i have a 2-d vector like vector < vector < coordinates > > v( points); where coordinates class is:

class coordinate{
    public :
    int x;
    int y;
    coordinate(){
        x=0;
        y=0;
    }

};

and points is 20. how to sort the individual vectors v[i] based on v[i].size() , ie based on number of coordinates objects pushed in v[i]. ???

Answer 1

1) make a function that compares two vectors based on size:

bool less_vectors(const vector& a,const vector& b) {
   return a.size() < b.size();
}

2) sort with it

sort(v.begin(),v.end(),less_vectors);

Answer 2

1. make a function which you can use whatever attributes to compare the objects and then use STL sort() algorithm to sort the container.

2. overload the < operation of that class and make it the same as the above function. Then you can use the sort() function provided by the STL containers (like STL list).