kendallknight. Efficient Implementation of Kendall's Correlation Coefficient Computation (i.e., O(n log n) complexity vs O(n^2) in base R)

github.com/pachadotdev/kendallknight

Vaya's read on this project

Problem, audience, market, and the verdict — sign in to see it.

Updates

No recent activity.