On 15.01.2013 20:50, Sturla Molden wrote:
You might want to look at this first:
https://github.com/numpy/numpy/issues/1811
Yes it is possible to compute the median faster by doing quickselect
instead of quicksort. Best case O(n) for quickselect, O(n log n) for
quicksort. But adding selection
You might want to look at this first:
https://github.com/numpy/numpy/issues/1811
Yes it is possible to compute the median faster by doing quickselect
instead of quicksort. Best case O(n) for quickselect, O(n log n) for
quicksort. But adding selection and partial sorting to NumPy is a bigger
is
On Jan 15, 2013, at 8:31 PM, Jerome Caron wrote:
> Dear all,
> I am new to the Numpy-discussion list.
> I would like to follow up some possibly useful information about calculating
> median.
> The message below was posted today on the AstroPy mailing list.
> Kind regards
> Jerome Caron
>
> #-
Dear all,
I am new to the Numpy-discussion list.
I would like to follow up some possibly useful information about calculating
median.
The message below was posted today on the AstroPy mailing list.
Kind regards
Jerome Caron
#
I think the calculation of medi
