/C++/Sort using comparator anonymous function c++

Sort using comparator anonymous function c++

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

Source: stackoverflow.com

Sort using comparator anonymous function c++

#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;
}

Source: stackoverflow.com

Similar codes

1 vote95 views1 answer
Gfg cyclic array rotation
C++
2 votes96 views6 answers
Loop in c++
C++
4 votes103 views2 answers
Max_element c++
C++
1 vote91 views1 answer
Xmake run with arg
C++
-1 vote111 views1 answer
Templates of templates c++
C++
2 votes111 views1 answer
Pbds in c++
C++
14 votes102 views6 answers
How to get size of array c++
C++
0 vote103 views2 answers
What is ++i and i++
C++
0 vote65 views1 answer
Sleep not declared in this scope c++
C++
0 vote94 views1 answer
C++ calorie calculator using a for loop
C++