Any way I can help expedite this?
On Fri, Jul 21, 2017 at 4:42 PM, Chun-Wei Yuan
wrote:
> That would be great. I just used np.argsort because it was familiar to
> me. Didn't know about the C code.
>
> On Fri, Jul 21, 2017 at 3:43 PM, Joseph Fox-Rabinovitz <
> jfoxrabinov...@gmail.com> wrote:
>
Not that I know of. The algorithm is very simple, requiring a
relatively small addition to the current introselect algorithm used
for `np.partition`. My biggest hurdle is figuring out how the calling
machinery really works so that I can figure out which input type
permutations I need to generate, a
Cool. Just as a heads up, for my algorithm to work, I actually need the
indices, which is why argsort() is so important to me. I use it to get
both ap_sorted and ws_sorted variables. If your weighted-quantile algo is
faster and doesn't require those indices, please by all means change my
impleme
