Sort a 2D array in C++ using built in functions(or any other method)?

by

I’m offering this up only because it was one of the few things std::qsort does well that std::sort simply does not, namely sort multi-column fixed arrays: The comparator is a string of ternary statements, but should be clear enough if you stare at it long enough:

#include <iostream>
#include <random>
#include <algorithm>

int main()
{
    int ar[10][2];

    // populate with random data
    std::random_device rd;
    std::default_random_engine rng(rd());
    std::uniform_int_distribution<> dist(1,20);
    std::for_each(std::begin(ar), std::end(ar),
        [&](int (&ar)[2]){ ar[0] = dist(rng); ar[1] = dist(rng); });

    std::cout << "Before Sort..." << '\n';
    std::for_each(std::begin(ar), std::end(ar),
        [](const int(&ar)[2]) { std::cout << ar[0] << ',' << ar[1] << '\n';});

    std::qsort(ar, 10, sizeof(*ar),
        [](const void *arg1, const void *arg2)->int
        {
            int const *lhs = static_cast<int const*>(arg1);
            int const *rhs = static_cast<int const*>(arg2);
            return (lhs[0] < rhs[0]) ? -1
                :  ((rhs[0] < lhs[0]) ? 1
                :  (lhs[1] < rhs[1] ? -1
                :  ((rhs[1] < lhs[1] ? 1 : 0))));
        });

    std::cout << "After Sort..." << '\n';
    std::for_each(std::begin(ar), std::end(ar),
        [](const int(&ar)[2]) { std::cout << ar[0] << ',' << ar[1] << '\n';});

    return 0;
}

Sample Run (yours will vary, obviously)

Before Sort...
2,11
18,4
20,20
14,6
8,10
17,8
14,14
3,10
20,14
19,19
After Sort...
2,11
3,10
8,10
14,6
14,14
17,8
18,4
19,19
20,14
20,20

Notes: this specifically uses strict-value comparison rather than subtraction short-cuts in the comparator so as to avoid potential underflow issues. If that is not a problem in your restricted data-space, you could easily make that comparator significantly simpler.

More Related Contents:

  1. what does this error mean in general? and how I fix it in this case? [closed]
  2. The intersection of two sorted arrays
  3. c++ sort with structs
  4. Insertion sort stops working after million input
  5. Why is sizeof giving incorrect number of bytes in C++?
  6. How do I compare chars (or strings) using void functions, also comparing chars that were taken from a struct array
  7. C++ – Find numbers between first and last negative numbers in Array
  8. If statement – C++
  9. Passing a 2D array to a C++ function
  10. How to convert vector to array
  11. Is std::vector so much slower than plain arrays?
  12. Why does cout print char arrays differently from other arrays?
  13. Address of an array
  14. Why does pointer decay take priority over a deduced template?
  15. Sort list using STL sort function
  16. Declaring the array size with a non-constant variable
  17. What is the difference between Static and Dynamic arrays in C++?
  18. Array with size 0 [duplicate]
  19. How can I sort a std::map first by value, then by key?
  20. Remove an array element and shift the remaining ones
  21. How to implement a natural sort algorithm in c++?
  22. How to initialize 3D array in C++
  23. How can I use an array as map value?
  24. Performance of qsort vs std::sort?
  25. C++ : Creating an array with a size entered by the user
  26. Pass arrays from C/C++ to Fortran and return a calculated array
  27. How to return array from C++ function to Python using ctypes
  28. array of pointers as function parameter
  29. Is there a way to statically-initialize a dynamically-allocated array in C++?
  30. C++ concatenate two int arrays into one larger array

Leave a Comment