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,
My guess;
First of all, you are actually manipulating twice as much data as opposed to
an inplace sort.
Moreover, an inplace sort gains locality as it is being sorted, whereas the
argsort is continuously making completely random memory accesses.
-Original Message-
From:
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
On Sun, Feb 16, 2014 at 5:50 PM, Eelco Hoogendoorn
hoogendoorn.ee...@gmail.com wrote:
My guess;
First of all, you are actually manipulating twice as much data as opposed to
an inplace sort.
Moreover, an inplace sort gains locality as it is being sorted, whereas the
argsort is continuously
On Sun, Feb 16, 2014 at 6:15 PM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 5:50 PM, Eelco Hoogendoorn
hoogendoorn.ee...@gmail.com wrote:
My guess;
First of all, you are actually manipulating twice as much data as opposed to
an inplace sort.
Moreover, an inplace sort gains
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
On Sun, Feb 16, 2014 at 4:18 PM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 6:15 PM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 5:50 PM, Eelco Hoogendoorn
hoogendoorn.ee...@gmail.com wrote:
My guess;
First of all, you are actually manipulating twice as much data as
On Sun, Feb 16, 2014 at 7:13 PM, Charles R Harris
charlesr.har...@gmail.com wrote:
On Sun, Feb 16, 2014 at 4:18 PM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 6:15 PM, josef.p...@gmail.com wrote:
On Sun, Feb 16, 2014 at 5:50 PM, Eelco Hoogendoorn
hoogendoorn.ee...@gmail.com
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
16 matches
Mail list logo
