package sort;
import java.util.Arrays;
public class Test51 {
static int count = 0;
public static void main(String[] args) {
int[] s = new int[] { 1, 2, 3, 9, 8, 2, 0 };
countrepair(s);
System.out.println(Arrays.toString(s));
System.out.println(count);
}
public static void countrepair(int[] a) {
int[] temp = new int[a.length];
repair(a, 0, a.length - 1, temp);
}
private static void repair(int[] a, int begin, int to, int[] temp) {
// TODO Auto-generated method stub
if (begin < to) {
int mid = (begin + to) >>> 1;
repair(a, begin, mid, temp);
repair(a, mid + 1, to, temp);
magerArray(a, begin, mid, to, temp);
}
}
private static void magerArray(int[] a, int begin, int mid, int to,
int[] temp) {
int i = begin;
int j = mid + 1;
int t = begin;
while (i <= mid && j <= to) {
if (a[i] > a[j]) {
temp[t++] = a[j++];
count += mid - i + 1;
} else {
temp[t++] = a[i++];
}
}
while (i <= mid) {
temp[t++] = a[i++];
}
while (j <= to) {
temp[t++] = a[j++];
}
int x = begin;
while (x <= to) {
a[x] = temp[x++];
}
}
}