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++)