Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add wrapper in MDArray for class cern.colt.GenericSorting #4

Open
rbotafogo opened this issue Mar 27, 2015 · 0 comments
Open

add wrapper in MDArray for class cern.colt.GenericSorting #4

rbotafogo opened this issue Mar 27, 2015 · 0 comments

Comments

@rbotafogo
Copy link

Generically sorts arbitrary shaped data (for example multiple arrays, 1,2 or 3-d matrices, and so on) using a quicksort or mergesort. This class addresses two problems, namely

Sorting multiple arrays in sync
Sorting by multiple sorting criteria (primary, secondary, tertiary, ...)
Sorting multiple arrays in sync

Assume we have three arrays X, Y and Z. We want to sort all three arrays by X (or some arbitrary comparison function). For example, we have
X=[3, 2, 1], Y=[3.0, 2.0, 1.0], Z=[6.0, 7.0, 8.0]. The output should be
X=[1, 2, 3], Y=[1.0, 2.0, 3.0], Z=[8.0, 7.0, 6.0].

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant