/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

25 votes238 views10 answers
Netflix
C++
0 vote236 views1 answer
Constexpr std::round c++
C++
0 vote214 views1 answer
Unique_ptr syntax
C++
0 vote225 views1 answer
Use regex replace in c++
C++
0 vote241 views1 answer
Sprintf add two xeroes for a float number
C++
0 vote191 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
0 vote263 views1 answer
Sort vector of strings
C++
0 vote212 views1 answer
Zero fill in c++
C++
0 vote219 views1 answer
Cuda shared array
C++
0 vote211 views2 answers
Union of two arrays
C++