Sorting a vector in descending order

Should I utilize

std::sort(numbers.begin(), numbers.end(), std::greater<int>());

std::sort(numbers.rbegin(), numbers.rend());   // note: reverse iterators

to sort a vector descendingly?

Are there any advantages or disadvantages to each approach?

Jul 5, 2022 in C++ by Nicholas
• 7,760 points • 2,204 views

No answer to this question. Be the first to respond.

Your answer

Your name to display (optional):

Email me at this address if my answer is selected or commented on:

Privacy: Your email address will only be used for sending these notifications.

Sorting vector elements in descending order

Because of the goto reset instruction, I believe your sort function has entered an infinite loop. If you wish to construct a basic bubble-sort algorithm, follow these steps: #include <iostream> #include <utility> #include <vector> void bubble_sort(std::vector<int>& v) { ...READ MORE

answered Jul 11, 2022 in C++ by Damon
• 4,960 points • 970 views

0 votes

0 answers

How can I get the maximum or minimum value in a vector?

In C++, how can I find the greatest or minimum value in a vector? Is it correct to assume that it would be similar with an array? Do I require an iterator? I tried max element, but I kept receiving errors. vector<int>::const_iterator it; it = max_element(cloud.begin(), cloud.end()); error: request for ...READ MORE

Jun 27, 2022 in C++ by Nicholas
• 7,760 points • 548 views

+1 vote

0 answers

Using push_back vs at in a vector in C++

I'm not sure how to use vectors in C++. It has to do with the vector's push back technique. I used push back to insert entries into the vector in the first programme. I used at() to insert entries into the vector in the second application. #include <iostream> #include <vector> #include <string> using namespace std; int main ...READ MORE

Jul 22, 2022 in C++ by Nicholas
• 7,760 points • 384 views

0 votes

0 answers

Efficient way to return a std::vector in c++

When delivering a std::vector in a function, how much data is duplicated, and how much of an optimization will it be to place the std::vector in free-store (on the heap) and provide a pointer instead, i.e. is: std::vector *f() { std::vector *result = new ...READ MORE

Aug 11, 2022 in C++ by Nicholas
• 7,760 points • 557 views

0 votes

1 answer

In C++, what is a virtual base class?

When employing multiple inheritance, virtual base classes are used to prevent several "instances" of a particular class from appearing in an inheritance hierarchy. Consider the following example: class A { public: void Foo() {} ...READ MORE

answered Jun 10, 2022 in C++ by Damon
• 4,960 points • 503 views

0 votes

1 answer

What really is a deque in STL?

A deque is defined somewhat recursively: fundamentally, ...READ MORE

answered Jun 10, 2022 in C++ by Damon
• 4,960 points • 694 views

0 votes

1 answer

Sorting a vector of custom objects

A simple example using std::sort struct MyStruct { ...READ MORE

answered Jun 1, 2022 in C++ by Damon
• 4,960 points • 1,234 views

0 votes

1 answer

How do I erase an element from std::vector<> by index?

You might perform the following to remove a single element: std::vector<int> vec; vec.push_back(6); vec.push_back(-17); vec.push_back(12); // Deletes the second element (vec[1]) vec.erase(std::next(vec.begin())); Alternatively, to remove many elements at once: // ...READ MORE