Nine degrees OJ topic 1069: Find student information continuation: custom sort collation

In the previous topic used two points to find, and the precondition of binary search is the original data order, it needs to be sorted first.

Consider sorting the data by using the sort function in the STL, and you need to give the collation because it is not the basic data type but the custom struct cannot automatically sort.

There are two ways of doing this:

1. Write CMP functions

BOOL CMP (stu A,stu b) {

Return strcmp (a.stu_no,b.stu_no) <0;

}

Then call sort (buf,buf+n,cmp);

2. The less-than operator that directly defines the struct (sort only needs to be sorted by less than the relationship) to illustrate the collation

struct stu{

...

BOOL operator< (const STU & x) const{

Return strcmp (stu_no,x.stu_no) <0;

}

}BUF[1000];

Nine degrees OJ topic 1069: Find student information continuation: custom sort collation