[
https://issues.apache.org/jira/browse/ARROW-10899?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17324903#comment-17324903
]
Antoine Pitrou commented on ARROW-10899:
----------------------------------------
I'm not sure we need intense benchmarking. Admittedly, it's better to test
sorting on all kinds of input (almost sorted, random, etc.). However, we don't
necessarily need that if we just want to find a cutoff point between radix
sorting and {{std::stable_sort}} (which is probably a merge sort with fallback
to a simpler sort for small sizes).
> [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
> Assignee: Kirill Lykov
> Priority: Major
> Attachments: Screen Shot 2021-02-09 at 17.48.13.png, Screen Shot
> 2021-02-10 at 10.58.23.png, all_random_wholeRange.png
>
>
> 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)
