/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 vote331 views7 answers
Hexo
C++
0 vote269 views1 answer
Postorder traversal calculator
C++
2 votes304 views1 answer
Eosio multi index clear
C++
0 vote355 views1 answer
C++ add to array
C++
0 vote353 views1 answer
C++ functions dynamic vector
C++
0 vote303 views1 answer
Declare a tab c++
C++
0 vote338 views1 answer
C++ bind port
C++
0 vote370 views1 answer
Java to puthon converter
C++
0 vote324 views1 answer
How to find total numbe of distinct characters in a string in c
C++
4 votes309 views3 answers
3d vector c++ resize
C++