You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Mar 21, 2024. It is now read-only.
You could zip values1 and values2 into a single tuple-array (array-of-structures) and then do a single key-value sort. Or you could create a index array (the natural numbers), sort that as the paired values, and then use it as a permutation map to reorder any number of other arrays in a simple gather-scatter kernel.
Sorry for a duplicate(https://github.com/NVlabs/cub/issues/40) but it's been closed without fix or workaround.
Suppose I've three arrays/vectors
and I want to sort values1 and values2 by keys.
It can be done by calling SortPairs twice.
Can the running time be improved by putting them in a single sort?
Can you provide a code snippet to do that or implementation require?
The text was updated successfully, but these errors were encountered: