On Fri, Feb 21, 2014 at 11:09 PM, Charles R Harris
wrote:
>
>
>
> On Fri, Feb 21, 2014 at 10:35 PM, Ondřej Čertík
> wrote:
>>
>> On Mon, Feb 17, 2014 at 11:40 AM, Charles R Harris
>> wrote:
>> >
>> >
>> >
>> > On Mon, Feb 17, 2014 at 11:32 AM, Julian Taylor
>> > wrote:
>> >>
>> >> On 17.02.2014
On Fri, Feb 21, 2014 at 10:35 PM, Ondřej Čertík wrote:
> On Mon, Feb 17, 2014 at 11:40 AM, Charles R Harris
> wrote:
> >
> >
> >
> > On Mon, Feb 17, 2014 at 11:32 AM, Julian Taylor
> > wrote:
> >>
> >> On 17.02.2014 15:18, Francesc Alted wrote:
> >> > On 2/17/14, 1:08 AM, josef.p...@gmail.com wr
On Mon, Feb 17, 2014 at 11:40 AM, Charles R Harris
wrote:
>
>
>
> On Mon, Feb 17, 2014 at 11:32 AM, Julian Taylor
> 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 wrote:
>> >>> On 16 Febru
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 wrote:
> >>> On 16 February 2014 23:43, wrote:
> What's the f
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 wrote:
>>> On 16 February 2014 23:43, wrote:
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly distributed,
On Mon, Feb 17, 2014 at 9:18 AM, 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 wrote:
>>> On 16 February 2014 23:43, wrote:
What's the fastest argsort for a 1d array with around 28 Million
elements, roughly uniformly
On 2/17/14, 1:08 AM, josef.p...@gmail.com wrote:
> On Sun, Feb 16, 2014 at 6:12 PM, Daπid wrote:
>> On 16 February 2014 23:43, wrote:
>>> What's the fastest argsort for a 1d array with around 28 Million
>>> elements, roughly uniformly distributed, random order?
>>
>> On numpy latest version:
>>
>
On Sun, Feb 16, 2014 at 4:12 PM, Daπid wrote:
> On 16 February 2014 23:43, 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']
>> the
>> >> argsort is continuously making completely random memory accesses.
>> >>
>> >>
>> >> -Original Message-
>> >> From: josef.p...@gmail.com
>> >> Sent: Sunday, February 16, 2014 11:43 PM
>> >>
sage-
> >> 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&#
On Sun, Feb 16, 2014 at 6:12 PM, Daπid wrote:
> On 16 February 2014 23:43, 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']:
nplace sort gains 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
uously 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
>
&
On 17 February 2014 00:12, Daπid 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 16 February 2014 23:43, 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, kind=kind)
%t
...@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 r
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
17 matches
Mail list logo
