Horje
sort 2d vector c++ Code Example
sort 2d vector c++ 
std::sort(vector1.begin(),
          vector1.end(),
          [] (const std::vector<double> &a, const std::vector<double> &b)
          {
              return a[3] < b[3];
          });
Source: stackoverflow.com
order 2d array in c++ 
9

The built-in arrays of C and C++ are very inflexible, among other things they cannot be assigned.

Your best option would be the 'array' class from the C++ standard library, at least for the inner dimension:

array<int, 2> a[5] = { { 20, 11 },
{ 10, 20 },
{ 39, 14 },
{ 29, 15 },
{ 22, 23 } };

sort( a, a + 5 );
Edit: Some more explanations.
Here we use the property of std::array that '<' by default compares them lexicographically, i.e. starts with the first element. In order to sort things differently we have to come up with an comparator object, so if you want to use the second column as sort key you have to do this:

auto comp = []( const array<int, 2>& u, const array<int, 2>& v )
      { return u[1] < v[1]; };
sort( a, a + 5, comp );
And as mentioned in the first comment, sort(a, a+5 ... is just an ugly short form for the cleaner sort(std::begin(a), std::end(a) ...
Source: stackoverflow.com



Cpp

Related
position of max element in vector c++ Code Example position of max element in vector c++ Code Example
Max element in an array with the index in c++ Code Example Max element in an array with the index in c++ Code Example
print vector c++ Code Example print vector c++ Code Example
count spaces in string java Code Example count spaces in string java Code Example
pass map as reference c++ Code Example pass map as reference c++ Code Example

Type:
 Code Example
Category:
 Coding
Sub Category:
 Code Example
Uploaded by:
 Admin
Views:
 8



 

Horje