Kendall-Tau: add an exhaustive test
It is always good to verify that a robust but slow algorithm is replaced
by a fast *and accurate* algorithm.
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
Description
Description
Details
Details
- Committed
Johannes Schindelin <johannes.schindelin@gmx.de> Jan 29 2014, 20:51 - Pushed
oburri Mar 8 2018, 18:06 - Parents
- R6269:2e678fa6501a: Use the fast Kendall Tau-b algorithm instead of the naive one
- Branches
- Unknown
- Tags