sorting using comparator in c++
struct point{
int weight, position, id;
};
// . . . . . .
// your code
// for sorting using weight
sort(points.begin(), points.end(), [] (point a, point b){
return a.weight < b.weight;
});
// for sorting using positions
sort(points.begin(), points.end(), [] (point a, point b){
return a.position < b.position;
});comparator in sort c++
bool com_fun(int a,int b){
if(a<b) return true;
else return false;
}
sort(arr,arr+n.com_fun);Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
