David Cournapeau wrote:
> Charles R Harris wrote:
>
>> Hi All,
>>
>> I changed the sort routines to sort nans to the end and got some
>> timings. Sorting 10 random doubles 100 times yields:
>>
>>current nan version
>> quicksort 1.17 sec1.29 sec
>> mergesort
Charles R Harris wrote:
> Hi All,
>
> I changed the sort routines to sort nans to the end and got some
> timings. Sorting 10 random doubles 100 times yields:
>
>current nan version
> quicksort 1.17 sec1.29 sec
> mergesort 1.37 sec1.36 sec
> heapsort
Hi All,
I changed the sort routines to sort nans to the end and got some timings.
Sorting 10 random doubles 100 times yields:
current nan version
quicksort 1.17 sec1.29 sec
mergesort 1.37 sec1.36 sec
heapsort 1.83 sec2.12 sec
Curiously, mergesort doe