[ARROW-13811] [Java] Provide a general out-of-place sorter

• Type: New Feature
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 7.0.0
• Component/s: Java
• Labels: pull-request-available
• External issue URL: https://github.com/apache/arrow/issues/29437
• Assignee: Liya Fan
• Reporter: Liya Fan
• Created: 31/Aug/21 10:31
• Updated: 11/Jan/23 08:35
• Resolved: 03/Dec/21 14:29

Description

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.

Issue Links

• links to: GitHub Pull Request #11035