Sturla Molden skrev:
> We recently has a discussion regarding an optimization of NumPy's median
> to average O(n) complexity. After some searching, I found out there is a
> selection algorithm competitive in speed with Hoare's quick select.
>
> Reference:
> http://ndevilla.free.fr/median/median.p
We recently has a discussion regarding an optimization of NumPy's median
to average O(n) complexity. After some searching, I found out there is a
selection algorithm competitive in speed with Hoare's quick select. It
has the advantage of being a lot simpler to implement. In plain Python:
impor
On Sat, Aug 22, 2009 at 11:03, denis bzowy wrote:
> Folks,
> here's a simple adaptive interpolator;
> drop me a line to chat about it
>
> adalin2( func, near, nx=300, ny=150, xstep=32, ystep=16,
> xrange=(0,1), yrange=(0,1), dtype=np.float, norm=abs )
>
> Purpose:
> interpolate a func
On Aug 31, 2009, at 2:33 PM, Ernest Adrogué wrote:
> 30/08/09 @ 13:19 (-0400), thus spake Pierre GM:
>> I can't reproduce that with a recent SVN version (r7348). What
>> version
>> of numpy are you using ?
>
> Version 1.2.1
That must be that. Can you try w/ 1.3 ?
__
30/08/09 @ 13:19 (-0400), thus spake Pierre GM:
> I can't reproduce that with a recent SVN version (r7348). What version
> of numpy are you using ?
Version 1.2.1
--
Ernest
___
NumPy-Discussion mailing list
NumPy-Discussion@scipy.org
http://mail.scipy
