[
https://issues.apache.org/jira/browse/ARROW-1571?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Yibo Cai updated ARROW-1571:
----------------------------
Comment: was deleted
(was: *speedup ratio <--> value range / array size for Intel E5-2650*
!e5-2650.png!)
> [C++] Implement argsort kernels (sort indices) for integers using O(n)
> counting sort
> ------------------------------------------------------------------------------------
>
> Key: ARROW-1571
> URL: https://issues.apache.org/jira/browse/ARROW-1571
> Project: Apache Arrow
> Issue Type: New Feature
> Components: C++
> Reporter: Wes McKinney
> Priority: Major
> Labels: Analytics
> Fix For: 2.0.0
>
>
> This function requires knowledge of the minimum and maximum of an array. If
> it is small enough, then an array of size {{maximum - minimum}} can be
> constructed and used to tabulate value frequencies and then compute the sort
> indices (this is called "grade up" or "grade down" in APL languages). There
> is generally a cross-over point where this function performs worse than
> mergesort or quicksort due to data locality issues
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
