For this Question: Calculate inversion count of array of integers. 
Inversion count of an array is quantisation of how much unsorted an array is. A sorted array has inversion count 0, while an unsorted array has maximum inversion count. 
Formally speaking inversion count = number of pairs i, j such that i < j and a[i] > a[j].The first line contain integers N.
The second line of the input contains N singly spaces integers.

1 <= N <= 100000
1 <= A[i] <= 1000000000Output one integer the inversion count.Sample Input
5
1 1 3 2 2

Sample Output
2

Sample Input
5
5 4 3 2 1

Sample Output
10, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
    static long count(int[] arr, int l, int h, int[] aux) {
        if (l >= h) return 0;

        int mid = (l +h) / 2;

        long count = 0;
        count += count(aux, l, mid, arr);
        count += count(aux, mid + 1, h, arr);
        count += merge(arr, l, mid, h, aux);

        return count;
    }

    static long merge(int[] arr, int l, int mid, int h, int[] aux) {
        long count = 0;
        int i = l, j = mid + 1, k = l;
        while (i <= mid || j <= h) {
            if (i > mid) {
                arr[k++] = aux[j++];
            } else if (j > h) {
                arr[k++] = aux[i++];
            } else if (aux[i] <= aux[j]) {
                arr[k++] = aux[i++];
            } else {
                arr[k++] = aux[j++];
                count += mid + 1 - i;
            }
        }

        return count;
    }
	public static void main (String[] args)throws IOException {

					  BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
						  String str[];
						  str = br.readLine().split(" ");
						  int n = Integer.parseInt(str[0]);
						  str = br.readLine().split(" ");
						  int arr[] =new int[n];
								for (int j = 0; j < n; j++) {
										arr[j] = Integer.parseInt(str[j]);

								}
								int[] aux = arr.clone();
								System.out.print(count(arr, 0, n - 1, aux));

	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?