/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 vote296 views1 answer
How initilaize deffult value to c++ class
C++
1 vote283 views1 answer
Use of undeclared identifier 'unique_ptr'
C++
0 vote270 views1 answer
Find N Unique Integers Sum Up to Zero
C++
1 vote270 views1 answer
Have unique vector after sorting vector
C++
8 votes289 views2 answers
Simple c++ program
C++
-1 vote322 views1 answer
Iterate over a range in c++
C++
0 vote270 views1 answer
Windows install cppcheck
C++
5 votes284 views1 answer
All library in c++
C++
3 votes274 views3 answers
C++ colored output
C++
0 vote283 views2 answers
How to create array with not constant size in cpp
C++