Package: kendallknight Type: Package Title: Efficient Implementation of Kendall's Correlation Coefficient Computation Version: 1.0.1 Authors@R: c( person( given = "Mauricio", family = "Vargas Sepulveda", role = c("aut", "cre"), email = "m.vargas.sepulveda@gmail.com", comment = c(ORCID = "0000-0003-1017-7574")), person( given = "Loader", family = "Catherine", role = "ctb", comment = "original stirlerr implementations in C (2000)" ), person( given = "Ross", family = "Ihaka", role = "ctb", comment = "original chebyshev_eval, gammafn and lgammacor implementations in C (1998)" ) ) Imports: stats Suggests: knitr, rmarkdown, spelling, testthat (>= 3.0.0) Depends: R(>= 3.5.0) Description: 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) , Abrevaya (1999) , Christensen (2005) and Emara (2024) . This implementation is described in Vargas Sepulveda (2025) . License: Apache License (>= 2) BugReports: https://github.com/pachadotdev/kendallknight/issues URL: https://pacha.dev/kendallknight/, https://github.com/pachadotdev/kendallknight RoxygenNote: 7.3.3 Encoding: UTF-8 NeedsCompilation: yes LinkingTo: cpp4r Config/testthat/edition: 3 Language: en-US Packaged: 2026-10-18 09:15:56 UTC; root Author: Mauricio Vargas Sepulveda [aut, cre] (ORCID: ), Loader Catherine [ctb] (original stirlerr implementations in C (2000)), Ross Ihaka [ctb] (original chebyshev_eval, gammafn and lgammacor implementations in C (1998)) Maintainer: Mauricio Vargas Sepulveda Repository: https://cran.r-universe.dev Date/Publication: 2025-12-11 06:52:15 UTC RemoteUrl: https://github.com/cran/kendallknight RemoteRef: HEAD RemoteSha: cb99b96ed9b56fbaa4f78f4263e95e497ddc6ed1