public class Solution { private int count; public int InversePairs(int[] array) { count = 0; MergeSort(array,0,array.length-1); return count; } public void Merge(int[] a,int low,int mid,int high){ int[] b = new int[high - low + 1]; int k,i,j; for(i=low,j=mid+1,k=0;i<=mid&&j<=high;k++){ if(a[i]...
