/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

0 vote285 views1 answer
What is a ~ in c++
C++
0 vote261 views1 answer
How to declare a 2d boolean vector in c++
C++
0 vote258 views1 answer
C function as paramter
C++
0 vote255 views10 answers
Hello world in c++
C++
4 votes264 views1 answer
Gcd of two numbers c++
C++
37 votes344 views2 answers
Remove element by index from vector c++
C++
0 vote271 views1 answer
Partition in STL using vector
C++
0 vote264 views1 answer
Filling 2d array with 0 c++
C++
0 vote262 views2 answers
Shortest path in unweighted graph bfs
C++
0 vote310 views1 answer
How to input a file path in c++
C++