Algorithms 练习2.5.19--Kendall tau距离

最新推荐文章于 2022-09-19 18:07:41 发布

VIP文章 TimeMagician

最新推荐文章于 2022-09-19 18:07:41 发布

阅读量626

点赞数

分类专栏： Algorithms Java sort

本文链接：https://blog.csdn.net/TimeMagician/article/details/78342236

版权

Kendall tau distance.Write a program KendallTau.javathat computes the Kendall tau distance between two permutations in linearithmic time

public class KendallTau {

    // return Kendall tau distance between two permutations
    public static long distance(int[] a, int[] b) {
        if (a.length != b.length) {
            throw new IllegalArgumentException("Array dimensions disagree");
        }
        int n = a.length;

        int[] ainv = new int[n];
        for (int i = 0; i < n; i++)
            ainv[a[i]] = i;//将a[]中元素和下标交换得ainv[]

        Integer[] bnew = new Integer[n];
        for (int i = 0; i < n; i++)