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
The sorter should work for any type of vectors, with a time complexity of O(n*log( n )).
Since it does not make any assumptions about the memory layout of the vector, its performance can be sub-optimal. So if another sorter is applicable (e.g.FixedWidthInPlaceVectorSorter), it should be used in preference.
The sorter should work for any type of vectors, with a time complexity of O(n*log( n )).
Since it does not make any assumptions about the memory layout of the vector, its performance can be sub-optimal. So if another sorter is applicable (e.g.
FixedWidthInPlaceVectorSorter
), it should be used in preference.Reporter: Liya Fan / @liyafan82
Assignee: Liya Fan / @liyafan82
PRs and other links:
Note: This issue was originally created as ARROW-13811. Please see the migration documentation for further details.
The text was updated successfully, but these errors were encountered: