sort(mMyClassVector.begin(), mMyClassVector.end(),
    [](const MyClass & a, const MyClass & b)
{
    return a.mProperty > b.mProperty;
});

sort(mMyClassVector.begin(), mMyClassVector.end(),
    [](const MyClass & a, const MyClass & b) -> bool
{
    return a.mProperty > b.mProperty;
});

#include<array>
#include<functional>

int main()
{
    std::array<int, 10> vec = { 1,2,3,4,5,6,7,8,9 };
    std::sort(std::begin(vec ), std::end(vec ), [](int a, int b) {return a > b; });
    for (auto item : vec)
      std::cout << item << " ";

    return 0;
}

#include <algorithm>
#include <vector>
#include <iterator>
#include <iostream>
#include <sstream>

struct Foo
{
    Foo() : _i(0) {};

    int _i;

    friend std::ostream& operator<<(std::ostream& os, const Foo& f)
    {
        os << f._i;
        return os;
    };
};

typedef std::vector<Foo> VectorT;

std::string toString(const VectorT& v)
{
    std::stringstream ss;
    std::copy(v.begin(), v.end(), std::ostream_iterator<Foo>(ss, ", "));
    return ss.str();
};

int main()
{

    VectorT v(10);
    std::for_each(v.begin(), v.end(),
            [](Foo& f)
            {
                f._i = rand() % 100;
            });

    std::cout << "before sort: " << toString(v) << "n";

    sort(v.begin(), v.end(),
            [](const Foo& a, const Foo& b)
            {
                return a._i > b._i;
            });

    std::cout << "after sort:  " << toString(v) << "n";
    return 1;
};

before sort: 83, 86, 77, 15, 93, 35, 86, 92, 49, 21,
after sort:  93, 92, 86, 86, 83, 77, 49, 35, 21, 15,