[SciPy-dev] Fast (O(n log(n)) ) implementation of Kendall Tau

[Sturla Molden]

Enzo Michelangeli skrev:
> Dear all,
>
> A few days ago I posted to http://projects.scipy.org/scipy/ticket/999 a 
> drop-in replacement for scipy.stats.kendalltau. 
Why do you re-implement mergesort in pure Python?

ndarrays have a sort method that can use mergesort.

Python lists has the same (timsort is mergesort on steroids).