code
>>>>> "S" == SeshanV
>>>>> on Sat, 30 Apr 2011 11:20:59 -0400 writes:
> I discovered that the Kendall's tau calculation in R uses
> all pairwise comparisons which is O(n^2) and takes a long time for
> large vectors. I implem
I discovered that the Kendall's tau calculation in R uses all pairwise
comparisons which is O(n^2) and takes a long time for large vectors. I
implemented a O(n*log(n)) algorithm based on merge-sort. Is this of interest to
be included in core R? The code (fortran and R wrapper) is available in m
