c++ vector sort

vector容器的排序方法

1. 重载 "<",用于 vactor 排序

2. 重载 "()"，用于 vector 排序

3. 提供一个比较函数，用于vector 排序

具体代码：

#include <iostream>
#include <vector>
/** vecor sort
 ** 降序
 **/
using namespace std;
class testIndex
{
    private:
        int value;
        int index;
    public:
        testIndex()
        {
            value = 0;
            index = 0;
        }
        testIndex(int idx,int v)
        {
            value = v;
            index = idx;
        }
        int getValue() const
        {
            return value;
        }
        int getIndex() const
        {
            return index;
        }
        bool operator ()(const testIndex *t1,const testIndex *t2) const
        {

            if(t1->value > t2 -> value)
            {
                return true;
            }
            else if(t1->value < t2->value)
            {
                return false;
            }
            if(t1->index > t2 ->index)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
        bool operator < (const testIndex &ti) const
        {

            if(value > ti.value)
            {
                return true;
            }
            else if(value < ti.value)
            {
                return false;
            }
            if(index > ti.index)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
};
bool compare_index(const testIndex *t1,const testIndex *t2)
{

    if(t1->getValue() > t2->getValue())
    {
        return true;
    }
    else if(t1->getValue() < t2->getValue())
    {
        return false;
    }
    if(t1->getIndex() > t2->getIndex())
    {
        return true;
    }
    else
    {
        return false;
    }

}
int main(int argc,char ** argv)
{
    vector<testIndex *> testVector1;
    vector<testIndex > testVector2;
    testIndex *t1 = new testIndex(0,10);
    testIndex *t2 = new testIndex(1,11);
    testIndex *t3 = new testIndex(2,12);
    testIndex *t4 = new testIndex(3,12);
    testIndex *t5 = new testIndex(4,12);
    testIndex *t6 = new testIndex(5,15);
    testVector1.push_back(t1);
    testVector1.push_back(t2);
    testVector1.push_back(t3);
    testVector1.push_back(t4);
    testVector1.push_back(t5);
    testVector1.push_back(t6);
    testVector2.push_back(*t1);
    testVector2.push_back(*t2);
    testVector2.push_back(*t3);
    testVector2.push_back(*t4);
    testVector2.push_back(*t5);
    testVector2.push_back(*t6);
    vector<testIndex *>::iterator it;
    vector<testIndex > ::iterator it2;
    sort(testVector2.begin(),testVector2.end()); //<< compare by "<"a
    for(it2 = testVector2.begin();it2 != testVector2.end();it2++)
    {
        cout << (*it2).getValue() << "\t" << (*it2).getIndex() << endl;
    }
    cout << endl;
    sort(testVector1.begin(),testVector1.end(),testIndex()); //<< compare by "()"
    for(it = testVector1.begin();it != testVector1.end();it++)
    {
        cout << (*it)->getValue() << "\t" << (*it)->getIndex() << endl;
    }
    sort(testVector1.begin(),testVector1.end(),compare_index); //<< compare by "compare_index"
    cout << endl;
    for(it = testVector1.begin();it != testVector1.end();it++)
    {
        cout << (*it)->getValue() << "\t" << (*it)->getIndex() << endl;
    }
    return 0;
}