[RESOLVED] vector sort

[Rajesh78]

#include<vector>
#include<algorithm>
using namespace std;

class MyObj
{
        public:
                MyObj(int v):value(v){}
                bool friend operator <  (const MyObj &Ob1, const MyObj &Ob2)
                {
                        if(Ob1.value < Ob2.value)
                               return   true;
                }
                int getValue()
                {
                        return value;
                }
        private:
                int value;
};
int main()
{
 MyObj b1 = 10;
        MyObj b2 = 16;
        MyObj b3 = 12;
        MyObj b4 = 8;

        vector <MyObj> vec2;
        vec2.push_back(b1);
        vec2.push_back(b2);
        vec2.push_back(b3);
        vec2.push_back(b4);

        for( auto &i:vec2)
                cout<<i.getValue() <<"  ";
        cout<<endl;
        sort(vec2.begin(),vec2.end());
        for( auto &j:vec2)
                cout<<j.getValue() <<"  ";
        cout<<endl;
        return 0;
}

i ran it in gcc the output is
$ ./a.exe
10 16 12 8
8 12 16 10

The output is wrong. But i doubt any mistake in the code. plz suggest

[2kaud]

But i doubt any mistake in the code.

But that's the only explanation!

The problem is here

bool friend operator <  (const MyObj &Ob1, const MyObj &Ob2)
                {
                        if(Ob1.value < Ob2.value)
                               return   true;
                }

What is returned if Ob1 is NOT < Ob2?

bool friend operator <  (const MyObj &Ob1, const MyObj &Ob2)
{
    return Ob1.value < Ob2.value;

[Rajesh78]

Thanks for quick suggestion. It worked