/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

10 votes239 views4 answers
Toupper c++
C++
0 vote232 views1 answer
Power of two c++
C++
5 votes227 views1 answer
Screen record ios simulator
C++
2 votes195 views2 answers
Palindrome checker in c++
C++
0 vote182 views1 answer
Cmake g++ address sanitizer
C++
0 vote188 views1 answer
Resize method in c++ for arrays
C++
0 vote230 views1 answer
Prime or not in cpp
C++
3 votes185 views2 answers
Fast Inverse Square Root
C++
4 votes198 views3 answers
Std vector random shuffle
C++
0 vote212 views1 answer
How to write a template c++
C++