ProgrammingThis forum is for all programming questions.
The question does not have to be directly related to Linux and any language is fair game.
Notices
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If you have any problems with the registration process or your account login, please contact us. If you need to reset your password, click here.
Having a problem logging in? Please visit this page to clear all LQ-related cookies.
Get a virtual cloud desktop with the Linux distro that you want in less than five minutes with Shells! With over 10 pre-installed distros to choose from, the worry-free installation life is here! Whether you are a digital nomad or just looking for flexibility, Shells can put your Linux machine on the device that you want to use.
Exclusive for LQ members, get up to 45% off per month. Click here for more info.
I have a vector of doubles (std::vector<doubles>). All I want to do is sort this into an order where the first element has the highest value, the second element the second highest value...the last element the lowest value.
The only promising thing I find is std::sort. But I cannot find any documentation on what it does. So I made a test:
Well, std::sort (and std::stable_sort) sorts all elements in the supplied range using operator < (less than). So if you want to sort using > (greater than), you can supply your own comparison function. The following program examplies:
Code:
#include <algorithm>
#include <iostream>
#include <vector>
static bool sort_using_greater_than(double u, double v)
{
return u > v;
}
int
main()
{
std::vector<double> v;
v.push_back(0.3);
v.push_back(0.1);
v.push_back(1.2);
v.push_back(0.01);
std::sort(v.begin(), v.end(), sort_using_greater_than);
for(std::vector<double>::size_type index = 0; index < v.size(); ++index)
std::cout << v[index] << std::endl;
}
LinuxQuestions.org is looking for people interested in writing
Editorials, Articles, Reviews, and more. If you'd like to contribute
content, let us know.