On Fri, Feb 21, 2014 at 11:09 PM, Charles R Harris
charlesr.har...@gmail.com wrote:
On Fri, Feb 21, 2014 at 10:35 PM, Ondřej Čertík ondrej.cer...@gmail.com
wrote:
On Mon, Feb 17, 2014 at 11:40 AM, Charles R Harris
charlesr.har...@gmail.com wrote:
On Mon, Feb 17, 2014 at 11:32 AM,
On Mon, Feb 17, 2014 at 11:40 AM, Charles R Harris
charlesr.har...@gmail.com wrote:
On Mon, Feb 17, 2014 at 11:32 AM, Julian Taylor
jtaylor.deb...@googlemail.com wrote:
On 17.02.2014 15:18, Francesc Alted wrote:
On 2/17/14, 1:08 AM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at
On Fri, Feb 21, 2014 at 10:35 PM, Ondřej Čertík ondrej.cer...@gmail.comwrote:
On Mon, Feb 17, 2014 at 11:40 AM, Charles R Harris
charlesr.har...@gmail.com wrote:
On Mon, Feb 17, 2014 at 11:32 AM, Julian Taylor
jtaylor.deb...@googlemail.com wrote:
On 17.02.2014 15:18, Francesc
On 2/17/14, 1:08 AM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 6:12 PM, Daπid davidmen...@gmail.com wrote:
On 16 February 2014 23:43, josef.p...@gmail.com wrote:
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed, random order?
On Mon, Feb 17, 2014 at 9:18 AM, Francesc Alted franc...@continuum.io wrote:
On 2/17/14, 1:08 AM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 6:12 PM, Daπid davidmen...@gmail.com wrote:
On 16 February 2014 23:43, josef.p...@gmail.com wrote:
What's the fastest argsort for a 1d array
On 17.02.2014 15:18, Francesc Alted wrote:
On 2/17/14, 1:08 AM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 6:12 PM, Daπid davidmen...@gmail.com wrote:
On 16 February 2014 23:43, josef.p...@gmail.com wrote:
What's the fastest argsort for a 1d array with around 28 Million
elements,
On Mon, Feb 17, 2014 at 11:32 AM, Julian Taylor
jtaylor.deb...@googlemail.com wrote:
On 17.02.2014 15:18, Francesc Alted wrote:
On 2/17/14, 1:08 AM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 6:12 PM, Daπid davidmen...@gmail.com wrote:
On 16 February 2014 23:43,
currently using numpy 1.6.1
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed, random order?
Is there a reason that np.argsort is almost 3 times slower than np.sort?
I'm doing semi-systematic timing for a stats(models) algorithm.
Josef
...@gmail.com
Sent: Sunday, February 16, 2014 11:43 PM
To: Discussion of Numerical Python
Subject: [Numpy-discussion] argsort speed
currently using numpy 1.6.1
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed, random order?
Is there a reason
On 16 February 2014 23:43, josef.p...@gmail.com wrote:
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed, random order?
On numpy latest version:
for kind in ['quicksort', 'mergesort', 'heapsort']:
print kind
%timeit np.sort(data,
On 17 February 2014 00:12, Daπid davidmen...@gmail.com wrote:
I seem unable to find the code for ndarray.sort, so I can't check. I have
tried to grep it tring all possible combinations of def ndarray,
self.sort, etc. Where is it?
Nevermind, it is in core/src/multiarray/methods.c
making completely random memory accesses.
-Original Message-
From: josef.p...@gmail.com
Sent: Sunday, February 16, 2014 11:43 PM
To: Discussion of Numerical Python
Subject: [Numpy-discussion] argsort speed
currently using numpy 1.6.1
What's the fastest argsort for a 1d array
locality as it is being sorted, whereas the
argsort is continuously making completely random memory accesses.
-Original Message-
From: josef.p...@gmail.com
Sent: Sunday, February 16, 2014 11:43 PM
To: Discussion of Numerical Python
Subject: [Numpy-discussion] argsort speed
currently
On Sun, Feb 16, 2014 at 6:12 PM, Daπid davidmen...@gmail.com wrote:
On 16 February 2014 23:43, josef.p...@gmail.com wrote:
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed, random order?
On numpy latest version:
for kind in
To: Discussion of Numerical Python
Subject: [Numpy-discussion] argsort speed
currently using numpy 1.6.1
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed, random order?
Is there a reason that np.argsort is almost 3 times slower than np.sort
-
From: josef.p...@gmail.com
Sent: Sunday, February 16, 2014 11:43 PM
To: Discussion of Numerical Python
Subject: [Numpy-discussion] argsort speed
currently using numpy 1.6.1
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed
On Sun, Feb 16, 2014 at 4:12 PM, Daπid davidmen...@gmail.com wrote:
On 16 February 2014 23:43, josef.p...@gmail.com wrote:
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed, random order?
On numpy latest version:
for kind in
17 matches
Mail list logo
