[
https://issues.apache.org/jira/browse/ARROW-10899?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17280197#comment-17280197
]
Yibo Cai commented on ARROW-10899:
----------------------------------
[~apitrou], please correct me if I missed somthing.
Code:
[vector_sort.cc|https://github.com/apache/arrow/blob/master/cpp/src/arrow/compute/kernels/vector_sort.cc]
Unit test:
[vector_sort_test.cc|https://github.com/apache/arrow/blob/master/cpp/src/arrow/compute/kernels/vector_sort_test.cc]
Benchmark:
[vector_sort_benchmark.cc|https://github.com/apache/arrow/blob/master/cpp/src/arrow/compute/kernels/vector_sort_benchmark.cc]
Please note current code supports sorting multiple columns, so looks a bit
complex.
I think we can start with single array sorter. Specifically, below code line
calling std::stable_sort
https://github.com/apache/arrow/blob/a321cdedb75b27b669995065ffe5596b3cfb3ae4/cpp/src/arrow/compute/kernels/vector_sort.cc#L378
> [C++] Investigate radix sort for integer arrays
> -----------------------------------------------
>
> Key: ARROW-10899
> URL: https://issues.apache.org/jira/browse/ARROW-10899
> Project: Apache Arrow
> Issue Type: Wish
> Components: C++
> Reporter: Antoine Pitrou
> Priority: Major
>
> For integer arrays with a non-tiny range of values, we currently use a stable
> sort. It may be faster to use a radix sort instead.
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
