cpp lambda function 1

cpp lambda function

ByAnurag batra 
#include 
using namespace std;

bool isGreater = [](int a, int b){ return a > b; }

int main() {
	cout << isGreater(5, 2) << endl; // Output: 1
	return 0;
}

Here is what the above code is Doing:
1. We are creating a lambda function that takes two integers as parameters and returns a boolean value.
2. We are assigning the lambda function to a variable isGreater.
3. We are calling the lambda function and passing 5 and 2 as arguments.
4. The lambda function returns true because 5 is greater than 2.

Similar Posts

unordered_set to vector

unordered_set to vector

ByAnurag batra

Before C++17 vector.insert(vector.end(), set.begin(), set.end()); After C++17 vector.reserve(set.size()); for (auto it = set.begin(); it != set.end(); ) { vector.push_back(std::move(set.extract(it++).value())); } Here is what the above code is Doing: 1. reserve() is called to make sure that the vector has enough space to hold all the elements of the set. 2. The set is iterated over…

bfs sudocode

bfs sudocode

ByAnurag batra

BFS (G, s) //Where G is the graph and s is the source node let Q be queue. Q.enqueue( s ) //Inserting s in queue until all its neighbour vertices are marked. mark s as visited. while ( Q is not empty) //Removing that vertex from queue,whose neighbour will be visited now v = Q.dequeue(…

greater

greater >

ByAnurag batra

std::sort(vii.begin(), vii.end(), std::greater()); Here is what the above code is Doing: 1. We create a vector of pairs of ints. 2. We sort the vector in descending order. 3. We print the vector. The output is: [(3, 2), (2, 1), (1, 0)]