import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
static int cnt = 0, n;
static int []a, b;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
n = cin.nextInt();
a = new int[n];
b = new int[n];
for(int i = 0; i < n; i++){
a[i] = cin.nextInt();
}
merge(0, n-1);
for (int i = 0; i < n; i++){
if (i != 0)
System.out.print(" ");
System.out.print(a[i]);
}
System.out.println();
System.out.println(cnt);
}
static void merge(int left, int right){
if(right - left < 1){
return;
}
int mid = (left + right) >> 1;
merge( left, mid);
merge(mid + 1, right);
int p = left, q = mid+1, pos = left;
while(p <= mid || q <= right){
cnt++;//统计比较的次数
if( q > right || (p <= mid && a[p] <= a[q])){
b[pos++] = a[p++];
}else{
b[pos++] = a[q++];
// cnt += mid -p +1;//统计逆序对的个数
}
}
for(int i = left; i <= right; i++){
a[i] = b[i];
}
}
}
归并排序求逆序对和比较次数+Java代码实现
最新推荐文章于 2022-03-23 16:06:41 发布