kendallknight
Efficient Implementation of Kendall's Correlation Coefficient Computation
The computational complexity of the implemented algorithm for Kendall's correlation is O(n log(n)), which is faster than the base R implementation with a computational complexity of O(n^2). For small vectors (i.e., less than 100 observations), the time difference is negligible. However, for larger vectors, the speed difference can be substantial and the numerical difference is minimal. The references are Knight (1966) <doi:10.2307/2282833>, Abrevaya (1999) <doi:10.1016/S0165-1765(98)00255-9>, Christensen (2005) <doi:10.1007/BF02736122> and Emara (2024) <https://learningcpp.org/>. This implementation is described in Vargas Sepulveda (2025) <doi:10.1371/journal.pone.0326090>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.1 |
2026-04-09 windows/windows R-4.5 | kendallknight_1.0.1.zip |
227.0 KiB |