tldr; This package implements a different algorithm from the one implemented in base R, and it reduces the complexity of the Kendall’s correlation coefficient from O(n^2) to O(n log n) resulting in a runtime of nano seconds or minutes instead of minutes or hours. This package is written in C++ and uses cpp11 to export the functions to R. See the vignette for the mathematical details.
If this software is useful to you, please consider donating on Buy Me A Coffee. All donations will be used to continue improving kendallknight.
You can install the released version of kendallknight from CRAN with:
install.packages("kendallknight")
You can install the development version of kendallknight like so:
remotes::install_github("pachadotdev/kendallknight")
See the documentation and vignette: https://pacha.dev/kendallknight/.
Please note that the kendallknight project is released with a Contributor Code of Conduct. By contributing to this project, you agree to abide by its terms.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4