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 v
[email protected] is safe to use (health: 45/100)
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/cran/kendallknightFirst published · 2025-12-11 11:45:17
Last updated · 2025-12-11T05:10:20+00:00