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: count=0
def implementMergeSort(arr,s,e):
    global count
    if e-s==1:
        return 
    
    mid=(s+e)//2
   
    
   
    implementMergeSort(arr,s,mid)
    
    implementMergeSort(arr,mid,e)
    count+=merge_sort_place(arr,s,mid,e)
    
    return count
    

def merge_sort_place(arr,s,mid,e):
    arr3=[]
    i=s
    j=mid
    count=0

    while i<mid and j<e:
        if arr[i]>arr[j]:
            arr3.append(arr[j])
            j+=1
            count+=(mid-i)

        else:
            arr3.append(arr[i])
            i+=1
        

    while (i<mid):
        arr3.append(arr[i])
        i+=1

    while (j<e):
        arr3.append(arr[j])
        j+=1

  
    for x in range(len(arr3)):
        arr[s+x]=arr3[x]
        
    return count


n=int(input())
arr=list(map(int,input().split()[:n]))

c=implementMergeSort(arr,0,len(arr))
print(c), In this Programming Language: Python, Now tell me if this Code is compilable or not?