arrow

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

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.

Closes #11035 from liyafan82/fly_0831_st

Authored-by: liyafan82 <fan_li_ya@foxmail.com>
Signed-off-by: liyafan82 <fan_li_ya@foxmail.com>