/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 vote349 views1 answer
C++ check if cin didn't get int
C++
3 votes328 views5 answers
Euclid algorithm
C++
18 votes370 views3 answers
Sort in descending order c++ stl
C++
2 votes339 views1 answer
Qt get hexa value from qstring
C++
0 vote359 views1 answer
Hello world cc++
C++
7 votes382 views5 answers
Stack c++
C++
1 vote375 views1 answer
How to read a line from the console in c++
C++
0 vote397 views1 answer
Get bitshift to wrap c++
C++
8 votes420 views1 answer
Remove or erase first and last character of string c++
C++
-2 votes359 views4 answers
Memset function in C++
C++