/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 vote128 views1 answer
Gtest assert not equal
C++
2 votes246 views1 answer
How to use winmain function
C++
1 vote205 views1 answer
How to round to nearest whole number unity
C++
0 vote190 views1 answer
"StepFileGen1." cpp.o failed jetson nano
C++
2 votes175 views2 answers
C++ random number between 1 and 10
C++
1 vote173 views1 answer
Ue4 iterate tmap c++
C++
0 vote172 views1 answer
Linux x11 copy paste event
C++
0 vote217 views1 answer
Remove item from layout
C++
0 vote147 views1 answer
Glut keyboard input
C++
0 vote624 views1 answer
Set keybinding for compiling c++ program in neovim
C++