Question

I was looking a way to sort struct using sort() function of STL:Algorithm library. I found a couple of codes using vector to do this. for example

struct person {
   std::string name;
   int age;
};
bool sort_by_name( const person & lhs, const person & rhs )
{
   return lhs.name < rhs.name;
}
bool sort_by_age( const person & lhs, const person & rhs )
{
   return lhs.age < rhs.age;
}
int main() {
   std::vector<person> people;
   // fill in the vector
   std::sort( people.begin(), people.end(), sort_by_name );
   std::sort( people.begin(), people.end(), sort_by_age );
}

我想知道,如果不使用矢量的话,是否有可能进行分类?如果是的话,如何进行?

Answer 1

http://www.cplusplus.com/reference/algorithm/sort/"rel="nofollow">std::sort 算法需要三个参数:

Random-Access iterators to the initial position.
Random-Access iterators to the final position and
Sorting criteria

So as long as you have any type which can provide the initial and final iterators and you provide the sorting criteria, you can use std::sorton that type.
It is important though that sorting criteria has Strict Weak Ordering.

友情链接